Data Structures and the Standard Template Library
"DATA STRUCTURES AND THE STANDARD TEMPLATE LIBRARY by William Collins teaches the fundamentals of Data Structures and their implementations. It uses C++ as the language of instruction. Most of the data structures are provided in the Standard Template Library (STL), which students will be able to use in their further coursework and beyond. To further students' understanding of implementation issues, alternative implementation (other than the STL) are also discussed. Hands-on learning is promoted throughout the text by the use of Programming Projects and labs. Programming projects, at the end of each chapter, allow students to develop and implement their own data structures or to extend or apply data structures introduced in the chapter. Additionally, optional labs accompany the text and allow students to practice by giving them opportunities to code. These labs can be used in many different ways such as in a closed lab, in an open lab, or for optional homework assignments"--Publisher description.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algorithm ancestor application array averageTime(n AVL tree AVLTree balanceFactor Big-O notation binary search tree binary tree BinSearchTree class bool Chapter close this output complete binary tree const string constant container class cout deallocated default constructor deﬁne deﬁnition deque deque class digit empty encoding endl enter a line enter a value erase method example field ﬁelds Figure ﬁle ﬁrst front gross pay heap height Hewlett-Packard Huffman code implementation infix input insert method integer iterator class iterator positioned linear Linked class list class list_node log2 logarithmic long_int loop method interfaces Move disk multiset names NULL number of items O(log object operator operatorStack parameter parent permute pointer pop_front Postcondition postfix Precondition priority queue priority_queue rb_tree rec_permute red-black tree retumed right child right subtree root item sentinel sort speciﬁcations stack Standard Template Library suppose Time(n variable vector class void worst worstTime(n writeBinary