Data abstraction & problem solving with C++ : walls and mirrors / Frank M. Carrano, Timothy Henry.

Includes index.

Chapter 1. Data abstraction: the walls -- C++ interlude 1. C++ classes -- Chapter 2. Recursion: the mirrors -- Chapter 3. Array-based implementation -- C++ interlude 2. Pointers, polymorphism, and memory allocation -- Chapter 4. Link-based implementations -- Chapter 5. Recursion as a problem-solving technique -- Chapter 6. Stacks -- C++ interlude 3. Exceptions -- Chapter 7. implementations of the ADT stack -- Chapter 8.Lists -- Chapter 9. List implementations -- Chapter 10. Algorithm efficiency -- Chapter 11. Sorting algorithms and their efficiency -- C++ interlude 4. Class relationships and reuse -- Chapter 12. Sorted lists and their implementations -- Chapter 13. Queues and priority queues -- Chapter 14. Queue and priority queue implementations -- C++ interlude 5. Overloaded operators and friend access -- Chapter 15. Trees -- Chapter 16. Tree implementations -- C++ interlude 6. Iterators -- Chapter 17. Heaps -- Chapter 18. Dictionaries and their implementations -- Chapter 19. Balanced search trees -- Chapter 20. Graphs -- Chapter 21. Processing data in external storage -- C++ interlude 7. The standard template library -- Appendix A. Review of c++ fundamentals -- Appendix B. Important themes in programming -- Appendix C. The unified modeling language -- AppendixD. The software life cycle -- Appendix E. Mathematical induction -- Appendix F. Algorithm verification -- Appendix G. Files -- Appendix H. C++ header files and standard functions -- Appendix I. C++ documentation systems -- Appendix J. ASCII character codes -- AppendixK. C++ for java programmers -- Appendix L. C++ for python programmers -- ındex.