Summaries and Customer Reviews are supplied by Amazon.com

Uses recent enhancements to C++, such as data type bool and C++ strings

States ADT operations in English, specifies them in pseudocode, and finally implements them in C++. Students can see more clearly the progression from an informal statement of an operation to a more formal specification.

Offers new and revised examples of ADTs that clarify their relationships to classes as well as new coverage of dynamically allocated arrays and circuits

Provides more balance between numeric and nonnumeric examples of recursion

Contains many new exercises and programming problems

Average Customer Rating:

Ive never read a better book than this.

Customer Rating:

So clear and so thorough. From LLs to stacks to queues to trees anything and everything you need is in this book. My teacher used one more type of tree traversal, which isn't in the book. the three methods described in it should be enough. Loved it so much that I wanted to buy its Java counterpart, but the ideas and the concepts are the same. C++, Java or C# the difference is decreasing by the second.

Masterpiece

Customer Rating:

This book is a great book to learn data structures. The book should not be read by the absolute beginner and you should have a solid C++ foundation. I used this book for a distance learning data structures class and found every chapter to be well written. The book explains everything in great detail even without an instructor to guide you through you will achieve a solid foundation in data structures. The book has excellent examples of recursion, sorting, hashing, and binary trees. They explain the efficiency(in big O) of the sorts\searches and when to use them. This book is an easy read with great examples but in some cases it helps to do computations on paper or compile small examples so you can truly understand how the various data structures are working. The section on hashing greatly demystifies hashing algorithms and how they work. You can download the sample code from the web. These authors did an excellent job of delivering a clear and concise text on data structures. I would recommend this book to anyone serious about learning data structures and recursion.

Read it and keep it near for reference

Customer Rating:

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.

This is a great book "Data Abstraction...."

Customer Rating:

"Algorithms and Data Structures" is a huge field. Lot of algorithms and data structures are used in todays computer software of variuos types. Not all data structures or algorithms on them are adequate for solving a particular problem, so you must have some skills to say which one is "better" than another in your particular situation. Despite it's name, this book is an almost complete reference to achieve this skills. "This is great book!!!!" I like it. ( ^.')

no complete code inside, messy descriptions	Customer Rating:
Before you read this book, I suggest that you have at least 2 years experiences on C++. Otherwise you will suffer from this book.