Data Structures: A Pseudocode Approach with C
This second edition expands upon the solid, practical foundation established in the first edition of the text.
Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
What people are saying - Write a review
2011 Cengage Learning abstract data type application array AVL tree B-tree balance binary search tree binary tree bool code is shown contains continued Copyright 2011 copied Copyright 2011 Cengage count create data structure dataPtr delete dequeue double number Due to electronic duplicated eBook and/or eChapter(s efficiency electronic rights empty end loop enqueue entry entryNdx example graph hashed list hashing head structure heap sort infix insertion sort integer left subtree linked list logic long double math merge run metadata module newPtr node’s number of elements operator path pList pLoc Post pPre pseudocode quick sort recursive reheap return false return true right subtree Rights Reserved root rotate scanned sequence shell sort shown in Algorithm shown in Figure shown in Program Statements suppressed target third party content traversal underflow unsorted upEntry vertex vertices void whole Write