Working Classes: Data Structures and Algorithms Using C++Based on object-oriented programming using C++, Working Classes strikes a balance between traditional CS2 topics and more progressive concepts and language, providing a clear understanding of what a data structure really is. And it can be used successfully by your students, whether or not they used an OOP approach in their CS1 class. The authors present key concepts in the text of topics that students will encounter later, such as memory management for lists and parsing for trees. The text includes hundreds of exercises plus a library of C++ code so students can experiment. The authors focus on "classes" as a particular implementation of an abstract data type, demonstrating the power, adaptability, and reusability of object-oriented programs. |
Common terms and phrases
abstract data type adjacency matrix algorithm atom AVL trees B-tree big-O binary search tree binary tree bit vector bytes cell char characters computer science const Number& const String& str2 constructor contains copy count the number current position data structure declaration define delete dictionary digits digraph disk element empty example Figure free block free list graph hash function hash table implementation input insertion instance int operator Integer Array integers iteration left subtree length linked list loop match member function memory node nptr NULL parse tree Pascal path pointer Post postfix prefix priority queue problem random represent require result right subtree root search tree property sequence Set<T sorted spanning tree stack str1 String sublist subset target template<class tion traversal true unchanged variable vertex vertices void words write zero