Package com.abstractkamen.datastructures.impl.trees.search

package com.abstractkamen.datastructures.impl.trees.search

Classes

Class	Description
AvlTree<T>	An AVL implementation of the BinarySearchTree interface.
PrefixTrieImpl	Basic implementation of a prefix 'trie'.
PrefixTrieImpl.PrefixTrieNode	Node structure for this tree implementation.
ReversePrefixTrie	This implementation uses the same insert/delete/search algorithm as the PrefixTrieImpl.