net.datastructures
Interface CompleteBinaryTree<E>

An interface for a complete binary tree. A binary tree with height
h is complete if the levels 0,1,2,...,h -
1 have the maximum number of nodes possible (that is, level
i has 2i nodes, for 0 <= i <=
h - 1) and in level h - 1 all the internal nodes
are to the left of the external nodes.