"Goodrich and Tamassia are excellent, highly knowledgeable writers who, with their Data Structures and Algorithms in Java, have created a first-class, university-level text. The writing is crystal clear, the explanations are rock solid, the chosen examples are enlightening, and the high-quality figures complement the text perfectly."
See the full JavaWorld review.
Every now and then you come across a book which is a pleasure to review and this is one of them. Aimed at the University undergraduate market, Data Structures and Algorithms in Java manages to be thorough, comprehensive and readable - a rare feat. The text is also well structured and the authors have clearly highlighted different paths aimed at different courses.
See the full review.
[Data Structures and Algorithms in Java] has a lot of good points, not least of which is a successful presentation of traditional data structures in an object-oriented framework.
In several places connections are drawn between the algorithm being discussed and important contemporary real-world problems (e.g. search engines, DNA sequence comparison, garbage collection), which students usually appreciate.
The problem sets are large, interesting, and thought-stimulating.
There is a good selection of problems at the end of each chapter. They are usefully divided into three sections: Reinforcement, Creativity, and Projects.
The Web site adds quite a bit of value to the book, particularly for instructors.