Data Structures in C++ Including Breadth and Laboratories
Data Structures in C++ Including Breadth and Laboratories integrates laboratory exercises, problem-solving skills, and breadth sections covering non-programming aspects of computer science into the study of data structures. An appendix on non-object-oriented features of C++ helps students froma C background get up to speed, and Chapter 4 presents the aspects of OOP in C++ that students need in studying data structures. Other aids to learning include Programming Projects, over 1,000 exercises, and numerous figures. Laboratory programs and data files, data structure implementations, and program examples from the text are available via the World Wide Web.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Elementary Data Structures
18 other sections not shown
abstract data type adjacency matrix adjacent ADT binary ADT list algorithm allocation array element assign binary search tree binary tree bintree Boolean function boolean_t bytes char character complexity constructor copy constructor cout current node current position data members data structure define definition delete depth-first search dequeue destructor display dynamic implementation edge empty endl enqueue Example execution Exercise FALSE Figure Function to return graph hash table head node header file Heapsort implementation of ADT indicates initialize inorder input insertion sort integer key_t left subtree linked list list implementation loop memory mergesort method nonempty NULL number of elements object operations output parameter pointer pointer_t Post prev Procedure quicksort rational number recursive return TRUE right subtree root Section selection sort static implementation Step string subarray Suppose traversal variable void