algorithm terminates array elements assume Atom Avail average number AVL tree B-trees binary search tree binary tree buddy CACM chain Chapter characters codes containing contiguous cylinder data structures decision tables deletion disk edge empty encoding encrypting entries example FIGURE free blocks garbage collection given go to step graph hash function hash table Huffman coding Info Link insertion integer internal nodes interpolation search Knuth left subtree linear linked list list structures locations mark memory method operations ordered tree overflow perform pointers preorder PRES PREV probe sequence queue Quicksort records reference count representation right subtree ring root search key sequential space spanning tree stack storage allocation function storage utilization stored string substring Suppose tag bits tape techniques threaded threaded tree track traversal tree of Fig underlying representations unsuccessful search variable weighted path length word
All Book Search results »
Memory Management: International Workshop IWMM 95, Kinross, UK, September 27 ...
Henry Givens Baker
No preview available - 1995