Subclasses of BinarySearchTree in goldman.collection.ordered |
class |
BalancedBinarySearchTree<E>
A balanced binary search tree uses rotations to maintain balance
when one path to a leaf becomes "to much longer" than another. |
class |
RedBlackTree<E>
The red-black tree is a balanced binary search tree in
which a single bit (a color of red or black) associated with each tree node is used
to ensure that the number of comparisons made when searching for any
element is at most 2 log2 n. |
class |
SplayTree<E>
A splay tree is a form of a balanced binary search tree in which
the nodes store no explicit information to enforce a balancing condition. |