Uses of Interface
net.datastructures.Tree

Uses of Tree in net.datastructures

Subinterfaces of Tree in net.datastructures

interface	BinaryTree<E> An interface for a binary tree, where each node can have zero, one, or two children.
interface	CompleteBinaryTree<E> An interface for a complete binary tree.

Classes in net.datastructures that implement Tree

class	ArrayListCompleteBinaryTree<E> A speedy implementation of the CompleteBinaryTree interface using a vector.
class	AVLTree<K,V> AVLTree class - implements an AVL Tree by extending a binary search tree.
class	BinarySearchTree<K,V> Realization of a dictionary by means of a binary search tree.
class	LinkedBinaryTree<E> An implementation of the BinaryTree interface by means of a linked structure.
class	LinkedTree<E> A linked class for a tree where nodes have an arbitrary number of children.
class	RBTree<K,V> Realization of a dictionary by means of a red-black tree.