Data Structures and Other Objects Using C++ takes a gentle approach to the data structures course in C++. Providing an early, self-contained review of object-oriented programming and C++, this text gives students a firm grasp of key concepts and allows those experienced in another language to adjust easily. Flexible by design, professors have the option of emphasizing object-oriented programming, covering recursion and sorting early, or accelerating the pace of the course. Finally, a solid foundation in building and using abstract data types is also provided, along with an assortment of advanced topics such as B-trees for project building and graphs.
This text takes a gentle approach to the data structures course in C++.
Where will you be ten years from now? How will a course in data structures help you? Perhaps you will be a software engineer writing large software in specialized areas...
Data Structures & Other Objects Using C++ 2e
Data Structures and Other Objects Using Java is a gradual, just-in-time introduction to Data Structures for a CS2 course.
Clearly written with the student in mind, this text focuses on Data Structures and includes advanced topics in C++ such as Linked Lists and the Standard Template Library (STL).
Balances the introduction of object-oriented concepts with data structures using C++. *NEW! Updated to comply with ANSI/ISO C++ Standard. *NEW! Programming project in section 4.6 on the polynomial class. *NEW!...
... int>("Rob", 28)); // insert (“Rob”,28) myMap["Joe"] = 38; // insert(“Joe”,38) myMap["Joe"] 50; // change to (“Joe”,50) myMap["Sue"] = 75; // insert(“Sue”,75) p = myMap.find("Joe"); // *p = (“Joe”,50) myMap.erase(p); ...
Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- ...
This book takes a gentle approach to the data structures course in Java. It offers an early, self-contained review of object-oriented programming and Java to give students a firm grasp...
35 12 / \ / \ / 33 25 5 12 33 25 5 / /\ 15 7 15 7 (2a) (2b) Heap Sort: Pass #3 35 - \ final adjustment A \ 12 ~ 33 12 \ / / / \ / 23, 255 15 25 5 / / / 15. 7 7 (3.a) (3.b) FIGURE 7.8. All passes of the heap sort.