Efficient Data Structures

Abstract

data type, see interface adjacency list, 145 adjacency matrix, 142 algorithmic complexity attack, 140 amortized cost, 17 amortized running time, 16 ancestor, 73 array circular, 31 ArrayDeque, 33 ArrayQueue, 30 arrays, 23 ArrayStack, 24 asymptotic notation, 9 backing array, 23 Bag, 21 BDeque, 60 Bibliography on Hashing, 136 big-Oh notation, 9 binary heap, 89 binary logarithm, 8 binary search tree, 78 size-balanced, 86 binary search tree property, 78 binary tree, 73 complete, 93 heap-ordered, 90 search, 78 binary-tree traversal, 75 BinaryHeap, 89 BinarySearchTree, 78 BinaryTree, 74 binomial coefficients, 9 binomial heap, 99 bounded deque, 60 breadth-first traversal, 77 breadth-first-search, 148 celebrity, see universal sink ChainedHashTable, 119 chaining, 119 child, 73 left, 73 right, 73 circular array, 31 coin toss, 14 collision resolution, 137 compare(x,y), 7 comparison tree, 110 comparison-based sorting, 101 complete binary tree, 93 complexity space, 16 time, 16 conflict graph, 141 connected components, 153 connected graph, 153 contact list, 1 correctness, 16 counting-sort, 112 CubishArrayStack, 51 cuckoo hashing, 137 cycle, 141