Data Structures II Essentials
Topics include sets, trees, advanced sorting, elementary graph theory, hashing, memory management and garbage collection, and appendices on recursion vs. iteration, algebraic notation, and large integer arithmetic.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A(key adjacency list alternative space tried arithmetic auxiliary array balance factor BEGlN lF binary search binary tree BOOLEAN breadth-first search bucket cell COMPARE-NODE computed converted corresponding data structure Daysplace deleting depth-first search disk Divide and Conquer edge elements END END Euler path following example fully parenthesized garbage collection GRAPH THEORY hash function head node heap sort heap structure index array infix inorder successor inorder traversal inserted iterative version Large Integers leaf left child linear probing linked list lNTEGER loop modified needed node points node-to-be-deleted Notation numnode operands operator ordered tree parent node Pascal pointer variable PREORDER PROCEDURE quadratic probing recursive call recursive code recursive version right child root rotation routine search algorithm set that contains sort algorithm SORTED LlST stack stored strictly binary subprogram subtree technique temp Threaded Trees Towers of Hanoi tree of depth tree traversal usually vertex vertices