Cover image for Object-oriented C++ data structures for real programmers
Object-oriented C++ data structures for real programmers
Harrington, Jan L.
Personal Author:
Publication Information:
San Diego : Morgan Kaufmann, [2002]

Physical Description:
xix, 552 pages ; illustrations ; 24 cm
General Note:
Includes index.
Format :


Call Number
Material Type
Home Location
Item Holds
QA76.64 .H3773 2002 Adult Non-Fiction Central Closed Stacks

On Order



Data structures play a key role in any serious development project, determining how the program acquires, stores, updates, and processes its in-memory data. Many of the basic techniques for constructing and governing access to data structures are well-documented, but most are structured programming techniques that do not translate well in an object-oriented environment. Object-Oriented C++ Data Structures for Real Programmers corrects this imbalance, teaching experienced C++ and Java developers the most effective methods for designing and implementing highly functional data structures in any type of object-oriented programming effort. The first part of the book introduces the various approaches, focusing on the purposes for which each is most suited. From there, the author examines advanced functionality that can be achieved in a number of ways, helping readers choose and apply the optimal technique.

Reviews 1

Choice Review

Harrington's book is part of the "For Real Programmers" series, which features advanced programming topics for people with appropriate programming skills. Because its audience would not need a review on the Software Life Cycle, programming concepts, or algorithms, topics typically found in an undergraduate data structures book, this book cuts to the chase, introducing arrays in the first chapter. Topics include arrays and vectors, linked lists, stacks and queues, binary trees, AVL and B-trees, binary heaps and priority queues, sorting and searching, hash tables, and dictionaries. Data structures are implemented in object-oriented programs. Chapter code examples demonstrate how to accomplish a common set of tasks using each data structure. In some cases, algorithms, in the form of pseudocode, are provided in place of C++ code examples. The book omits coverage of graphs in favor of more in-depth treatment of trees. Harrington (Marist College) has published more than 35 books on a variety of topics, including Macintosh application software, database software, programming, and Ethernet networking. Appropriate for graduate students or professionals. S. Underwood University of West Alabama

Table of Contents

Chapter 1 Introducing Object Oriented Data Structure Arrays
Chapter 2 Vectors
Chapter 3 Linked Lists
Chapter 4 Stacks and Queues
Chapter 5 Binary Trees
Chapter 6 AVL Trees
Chapter 7 B Trees
Chapter 8 Heaps and Priority Queues
Chapter 9 Sorting and Searching
Chapter 10 Hash Tables
Chapter 11 Dictionaries
Chapter 12 The Video Store
Chapter 13 The Corner Pharmacy
Appendix A Templates
Appendix B Demonstration Program Application Classes