index assignment operators assignnum function at function atkinsonm auf der heidef meyer augmenting paths - average-case analysis binary search trees - quicksorts - avl trees - deletion double rotation - references for - single rotation - avlnode structure azary -trees with disk access - references for - back edges in depth-first searches back function for lists for stacks for vectors - backtracking algorithms - games - alpha-beta pruning - minimax algorithm - principles turnpike reconstruction - bacon numbers baerj baeza-yatesr balance conditions avl trees - double rotation - references for - single rotation - balanced binary search trees - balancing symbolsstacks for - balls and bins problem baloghj banachowskil barskym base logarithms base cases induction recursion - baseball card collector problem bavelz bayerr begin function for iterators - for lists - for sets bellt bellmanr bentleyj best-case analysis best fit bin packing algorithm - bestmove function bekesij bhaskars biconnected graphs - big-oh notation - big-omega notation bin packing - best fit for - first fit for - next fit for off-line algorithms for - on-line algorithms for references for binary heaps - heap order - operations - buildheap - decreasekey deletekey deletemin - increasekey insert - remove - references for structure - binary search trees - - average-case analysis - avl trees - double rotation - references for - single rotation - class template for - operations contains - destructors and copy assignment findmin and findmax - insert - remove - optimal - for priority queue implementation red-black see red-black trees references for binary searches binary trees expression - huffman code - implementations traversing - binaryheap class binarynode structure binary search trees binary trees - top-down splay trees - binarysearch function binarysearchtree class binomial queues - amortized analysis - implementation - lazy merging for - operations - references for - structure of binomial trees binomialnode structure binomialqueue class - bipartite graphs bitnerj bjornssony bloomg blumm blumn boggle game bollobasb bookkeeping costs in recursion