Rating: 
Summary: Good down to earth data structures
Review: If you want to learn data structures, this book has lots of good information. In fact, my university uses this book for its data structures class. This book also uses c++ but no STL. It would be nice to have STL since we want the code to be reusable for any objects.
Rating: 
Summary: Poor explanations/examples. I implore: Don't even bother!
Review: It all starts clearly, but as you start reading the second chapter, the book becomes very vague and offers only unclear examples and unexplained deductions. The examples are just not descriptive enough. It's like reading a calculus book but with more wordiness and less precise description. The books lacks of pace and balance; it goes from clear to total blur from one sentence to the other.
You won't be doing yourself a favor with this one.
Rating:
Summary: Best written book in data structures.
Review: The materials in this book are very well organized and easy to understand; Enough for most programmers.
Rating: 
Summary: Simply "one of the best text book" on Data structure!!
Review: The style of writing is easy to understand. Recursion and Sorting chapters are excellent. Should include more detail about double linked list. Should explain more in detail about bindary tree class implimentation.
Rating:
Summary: The best intorductory book for Data Structures
Review: This book does an excellent job of intorducing the mechanics of Data structures. A very useful book to refresh one's knowledge about data structures and get a rigororus insight in the subject in preparation for advanced studies in the area of Data Structures.Good book for an introductory University course in Data Structures. This bok has been successfully used (and is still being used) as a standard textbook in an intro course in Data Structures at UT Austin Prerequisites: Atleast 1 introductory programming course in any high level language (preferrably C++). A decent knowledge of C++. (no need of OOP knowledge). Reader should be prepared to seriously study this book. This is a full blown ACADEMIC book, not a tutoorial
Rating:
Summary: Read it and keep it near for reference
Review: This book is one of the best of its kind that I have read.
It is very descriptive and contains a lot of good examples on the subjects.
It describes the construction of a lot of the collection classes like lists, trees, queues etc. and how this is most efficiently sorted and structured.
Other subjects are graphs, the Big "O" Notation for evaluation of algorithm performance and a very good description on how and when to use recursion (The mirrors).
All subjects are described in detail with great examples.
To further test if the subjects have been understood a self-test section is at the end of each chapter (and the answers are in the back of book).
The reader of the book should have some knowledge of object-oriented design, but besides that the code is fairly easy to read.
In short it's a buy.
Rating:
Summary: EXTREMELY CONFUSING AND VAGUE. A MONEY WASTER!
Review: This book is only worth it if you already know Data Structures/Data Abstraction. You should buy it only if you have been doing this for years and want to refresh your mind. But even so, the examples are poor and vague. There is no consistency, it goes from clear to a blury mess. This is the type of book that even after reading 50 times you still won't get the descriptions unless you buy 10 other books or you have previous experience in the field.
Rating:
Summary: TOTAL MONEY WASTER!
Review: This book is only worth it if you already know Data Structures/Data Abstraction. You should only buy if you have been doing this for years and want to refresh your mind. But even so, the examples are poor and vague. There is no consistency, it goes from clear to a blury mess. this is the type of book that even after reading 50 times you still won't get the descriptions unless you buy 10 other books or you have previous experience in the field.
Rating:
Summary: Good book...
Review: This book is very well written. The language is very clear, but the topic is rather dense. You need to read, then think, then read again. Many of the examples in the book are given in Pseudo-code. I like that. It makes it easy to follow the logic of the author and figure out how to code it yourself. It doesn't "give" you the answers. The Section on recursion is basic, but good (think standard "Hanoi Towers"). The section on Algorithm Efficiency and Sorting is very well done... Overall, I have not looked at too many of these books, so don't necessarily take my review as authoritative. All I can say is that the language and presentation of the topics in this book is very clear and understandable...
Rating:
Summary: Disappointing
Review: This book is written poorly, and code is designed very poorly. It seems that the authors did not ween themselves of C and tried to move on to C++. There is huge amount of useless code and comments for obvious functions. Simple things are over-complicated in the explanations. There is no mention of STL. Do not buy this book.
| 
