Data Structures with C++ Using STL, 2nd edition

This book uses a modern object-oriented approach to data structures, unified around the notion of the Standard Template Library (STL) container classes. The book presents a systematic development of data structures supported by numerous examples and complete programs. The authors separate the applications of a data structure from its implementation. In the later chapters, the book transitions students into the study of applied algorithms. This creates a bridge to subsequent courses in advanced data structures and algorithms.

• NEW - Data structures presented using the model of the Standard Template Library (STL)—Over the course of the book, student master the use and implementation of the STL container classes.

  • Teaches students the modern approach to data structures. Ex.___

• NEW - Simple algorithms integrated throughout the text.

  • Includes an applied study of interesting and classical algorithms that illustrate the data structures using only simple mathematical concepts. (Big-O notation is introduced intuitively). Ex.___

• NEW - Many additional figures integrated into the presentation.

  • Lead students through the concepts. Ex.___

• NEW - ADT (Abstract Data Type) for each data structure—Immediately used to solve appropriate problems.

  • Book provides students with many examples before presenting the corresponding implementation so that students see a data structure unfold and are then able to trace back through the examples when looking at the implementation. Ex.___

• NEW - Early and accessible introduction to templates and iterators.

  • Allows students to understand and use powerful abstractions available in modern data structures. Ex.___

• NEW - Later chapters (Chapters 11 - 17) supplement the CS2 course.

  • Appropriate material for an advanced data structures and algorithms course. Ex.___

• Use of modern C++ constructs in developing data structures and their applications—Provides enough language detail to sufficiently understand the constructs. A fuller explanation of language details available on the Companion Website.

  • Reflects the type of data structures that students would use in the real world. Ex.___

• Extensive pedagogy—Includes many complete programs with output, case studies, review exercises with solutions, extensive written exercises and programming exercises, programming projects, and glossary of key terms.

  • Helps students learn, review, and retain material. Ex.___

• Data structures presented using the model of the Standard Template Library (STL)—Over the course of the book, student master the use and implementation of the STL container classes.

  • Teaches students the modern approach to data structures. Ex.___

• Simple algorithms integrated throughout the text.

  • Includes an applied study of interesting and classical algorithms that illustrate the data structures using only simple mathematical concepts. (Big-O notation is introduced intuitively). Ex.___

• Many additional figures integrated into the presentation.

  • Lead students through the concepts. Ex.___

• ADT (Abstract Data Type) for each data structure—Immediately used to solve appropriate problems.

  • Book provides students with many examples before presenting the corresponding implementation so that students see a data structure unfold and are then able to trace back through the examples when looking at the implementation. Ex.___

• Early and accessible introduction to templates and iterators.

  • Allows students to understand and use powerful abstractions available in modern data structures. Ex.___

• Later chapters (Chapters 11 - 17) supplement the CS2 course.

  • Appropriate material for an advanced data structures and algorithms course. Ex.___