|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BalancedBinarySearchTree | |
---|---|
goldman.collection.ordered | An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates. |
Uses of BalancedBinarySearchTree in goldman.collection.ordered |
---|
Subclasses of BalancedBinarySearchTree in goldman.collection.ordered | |
---|---|
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. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |