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.
25 pages matching right subtree in this book
Results 1-3 of 25
What people are saying - Write a review
We haven't found any reviews in the usual places.
abstract data type adjacency matrix adjacent algorithm array atom AVL trees B-tree big-O binary search tree binary tree bit vector Boyer-Moore algorithm bytes cell char characters computer science const Number& const String& copy constructor current position data structure declaration deﬁne delete difﬁcult digit DigitList disk edge efﬁcient element empty example ﬁeld Figure ﬁle ﬁnd ﬁnding ﬁrst free block free list function calls graph hash implementation input insertion instance int operator IntegerArray integers iteration left subtree length linked list List ADT loop match member data member function memory n.currentSize node nptr NULL parse tree Pascal pointer Post postﬁx preﬁx problem queue recursive recursive deﬁnition represent require right subtree root sorted speciﬁcation stack str1 str2 String strl sublist target template<class there’s tion TList<T traversal true vertex vertices void write zero