best fitsee memory managementbest fit best-case analysis - big-oh notationsee notation bin packing - binary searchsee searchbinary binary search treesee bst binary tree - bstsee bst complete full - implementation node - - null pointers overhead parent pointer space requirements - terminology - threaded traversalsee traversalbinary tree binsort - bintree birthday problem block boolean expression clause conjunctive normal form literal boolean variable branch and bounds breadth-first search - bstxv - - - - index efficiency insert - remove - search - search tree property traversalsee traversal -tree - analysis - -tree - -tree bubble sort - buffer poolxv - - adt - replacement schemes - - cache - cd-rom cd-rom ceiling function city database class see object-oriented programmingclass clique cluster problem clusterfile code tuning - - - collatz sequence comparatorxiv compiler activation record efficiency optimization complexity