Key Features
There are a number of special features that I believe together make this book a unique approach to covering the subject of data structures and algorithms:
- Consistent format for every chapter
Every chapter (excluding those in the first part of the book) follows a consistent format. This format allows most of the book to be read as a textbook or a reference, whichever is needed at the moment.
- Clearly identified topics and applications
Each chapter (except Chapter 1) begins with a brief introduction, followed by a list of clearly identified topics and their relevance to real applications.
- Analyses of every operation, algorithm, and example
An analysis is provided for every operation of abstract datatypes, every algorithm in the algorithms chapters, and every example throughout the book. Each analysis uses the techniques presented in Chapter 4.
- Real examples, not just trivial exercises
All examples are from real applications, not just trivial exercises. Examples like these are exciting and teach more than just the topic being demonstrated.
- Real implementations using real code
All implementations are written in C, not pseudocode. The benefit of this is that when implementing many data structures and algorithms, there are considerable details pseudocode does not address.
- Questions and answers for further thought
At the end of each chapter (except Chapter 1), there is a series of questions along with their answers. These emphasize important ideas from the chapter and touch on additional ...