Package goldman.collection.ordered

An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates.

See:
          Description

Interface Summary
OrderedCollection<E> An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates.
TreeNode<E> The TreeNode interface must be supported by any class defining objects to be used as nodes in a search tree.
 

Class Summary
AbstractSearchTree<E> The AbstractSearchTree class is an abstract class that includes the methods that are shared by all search trees.
BalancedBinarySearchTree<E> A balanced binary search tree uses rotations to maintain balance when one path to a leaf becomes "to much longer" than another.
BinarySearchTree<E> This class implements a standard binary search tree.
BPlusTree<E> The B+-tree is variation of a B-tree in which the internal nodes are used only for navigation.
BTree<E> A B-tree is a balanced binary search tree in which each node can hold between t-1 and 2t-1 elements, where integer t > 1 is provided as a parameter to the constructor.
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.
SkipList<E> The skip list is a sorted list with additional structure that supports finding an element in expected logarithmic time.
SortedArray<E> The sorted array provides very efficient use of space and the fastest search time independent of the access pattern.
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.
TopDownBTree<E> The top down B-tree implements a variation of a B-tree that uses top-down (versus bottom-up) insertion and deletion.
TreeIterator<E> The TreeIterator class is an abstract class that implements the Iterator interface for any search tree.
 

Package goldman.collection.ordered Description

An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates.