A Practical Introduction to Data Structures and Algorithm Analysis

600 INDEXbest fit, see memory management, bestfitbest-case analysis, 63–65big-Oh notation, see O notationbin packing, 579–580binary search, see search, binarybinary search tree, see BSTbinary tree, 153–205BST, see BSTcomplete, 154, 155, 170, 171, 181,257full, 154–157, 169, 170, 189, 199,225implementation, 153, 156, 198node, 153, 157–158, 162–169null pointers, 157overhead, 169parent pointer, 163space requirements, 157, 163,169–170terminology, 153–155threaded, 203traversal, see traversal, binary treeBinsort, 85, 86, 259–265, 268, 337, 563bintree, 471, 476birthday problem, 332, 353block, 298, 303Boolean expression, 572clause, 572Conjunctive Normal Form, 572literal, 572Boolean variable, 8, 30, 95branch and bounds, 579breadth-first search, 389, 404–406, 419BST, xv, 171–180, 199–201, 203, 230,250, 256, 364–367, 369, 370,375, 447, 452–459, 461, 470,475, 476, 539, 544efficiency, 179insert, 175–176remove, 176–179search, 173–174search tree property, 172traversal, see traversalB-tree, 318, 331, 358, 363, 372–382,384, 473analysis, 381–382B + -tree, 8, 10, 359, 363, 375–382,384, 385, 448B ∗ -tree, 381Bubble Sort, 80, 240–243, 266, 272buffer pool, xv, 12, 279, 289–297,314–316, 325, 326, 365, 374,438ADT, 292–297replacement schemes, 290–291,326–328cache, 282, 289–297, 325CD-ROM, 8, 9CD-ROM, 281, 284, 332ceiling function, 30city database, 151, 203, 465, 476class, 100, see object-orientedprogramming, classclique, 570, 575, 576, 578, 589, 590cluster problem, 230, 476cluster, file, 285, 287, 288, 438code tuning, 57–59, 87–88, 90,255–256Collatz sequence, 72, 93, 581, 588, 592comparator, xiv, 16compiler, 89activation record, 128efficiency, 58optimization, 88complexity, 11