Uses of Class
goldman.collection.ordered.AbstractSearchTree

Packages that use AbstractSearchTree
goldman.collection.ordered An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates. 
goldman.collection.spatial A spatial collection is an untagged algorithmically positioned collection that organizes its elements by their location in a multidimensional space. 
 

Uses of AbstractSearchTree in goldman.collection.ordered
 

Subclasses of AbstractSearchTree 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 BinarySearchTree<E>
          This class implements a standard binary search tree.
 class BPlusTree<E>
          The B+-tree is variation of a B-tree in which the internal nodes are used only for navigation.
 class 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.
 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.
 class TopDownBTree<E>
          The top down B-tree implements a variation of a B-tree that uses top-down (versus bottom-up) insertion and deletion.
 

Uses of AbstractSearchTree in goldman.collection.spatial
 

Subclasses of AbstractSearchTree in goldman.collection.spatial
 class QuadTree<E>
          A quad tree divides the subdomain into four regions at each internal node.