Data Structures and Algorithm Analysis - Computer Science at ...

INDEX 577building, 172–177for memory management, 414insert, 172max-heap, 171min-heap, 171, 289partial ordering property, 171remove, 177siftdown, 176, 177, 262, 263Heapsort, 171, 243–245, 252, 262, 288heuristic, 553–554hidden obligations, see obligations,hiddenHuffman coding tree, 145, 147, 154,178–188, 191–194, 218, 430prefix property, 186independent set, 563index, 11, 259, 341–368file, 285, 341inverted list, 345, 366linear, 8, 343–345, 366, 367tree, 342, 348–365induction, 217induction, proof by, see proof, inductioninheritance, xvi, 95, 97, 103, 137, 156,157, 159, 161inorder traversal, see traversal, inorderinput size, 55, 59Insertion Sort, 74, 225–228, 230–233,242, 252, 254–259, 261, 262Double, 261integer representation, 4, 8–9, 20, 142inversion, 227, 231inverted list, see index, inverted listISAM, 342, 346–348, 366k-d tree, 442–447, 451, 453, 456K-ary tree, 210–211, 215, 217, 447key, 131–133kilobyte, 27knapsack problem, 552, 564, 565Kruskal’s algorithm, xv, 244, 397–398,401largest common factor, 49, 523–524latency, 270, 272, 273least frequently used (LFU), 276, 298,310least recently used (LRU), 276, 298,299, 310, 357LIFO list, 117linear growth, see growth rate, linearlinear index, see index, linearlinear search, see search, sequentiallink, see list, link classlinked list, see list, linkedLISP, 46, 407, 422, 424, 425list, 22, 93–143, 145, 179, 342, 405,407, 481ADT, 9, 93–97, 138append, 99, 113, 114array-based, 8, 93, 97–100,108–111, 117, 142basic operations, 94circular, 140comparison of space requirements,140current position, 94, 95, 102–103,106, 111doubly linked, 112–117, 140, 142,154space, 114–117element, 94, 111–112freelist, 107–108, 414–424head, 94, 100, 102implementations compared,108–111initialization, 94, 97, 99insert, 94, 99, 100, 102–106, 111,113–114, 116, 145link class, 100–101linked, 8, 93, 97, 100–111, 344,405, 429, 516, 517, 521