links array (cont structures two-dimensional union average-case running time avl tree balanced tree operations basic data types best-case running time bi-connected components big- notation binary file binary heap applications deleting inserting binary search binary search tree operations binary tree huffman' tree in-order level-order post-order pre-order traversing binomial heap linked representation operations this page has been reformatted by knovel to provide easier navigation