Data Structures: A Pseudocode Approach with C++This new text makes it simple for beginning computer science students to design algorithms first using pseudocode and then build them using the C++ programming language. Based on Gilberg and Forouzan's successful text, Data Structures: A Pseudocode Approach with C, this new book emphasizes a practical approach to data structures. |
Contents
ADT Class Templates | 13 |
BigO Analysis Examples | 21 |
Linked List Resolution | 65 |
Copyright | |
29 other sections not shown
Other editions - View all
Data Structures: A Pseudocode Approach with C Richard F. Gilberg,Behrouz A. Forouzan No preview available - 2004 |
Common terms and phrases
abstract data type Analysis array AVL tree B-tree balance binary search tree binary tree bool breadth-first traversal bubble sort code is shown constructor contains count cout create data structure dataIn dataOut delete a node dequeue destructor efficiency empty end loop enqueue entry entryNdx example function graph hashed list heap sort implementation input insertion sort integer iostream iterator KTYPE left subtree linked list locn logic memory merge run metadata module newPtr NODE<TYPE null operator output parameters path pLoc pointer Post postfix pPre pseudocode quick sort random number rear recursive reheap return false return true right subtree root rotation selection sort sequence shell sort shown in Algorithm shown in Figure shown in Program sort algorithm stack Statements string taller target template class TYPE traversal underflow unsorted upEntry vertex vertices void Write