Uses of Interface
net.datastructures.BinaryTree

Uses of BinaryTree in net.datastructures

Subinterfaces of BinaryTree in net.datastructures

interface

CompleteBinaryTree<E> An interface for a complete binary tree.

Classes in net.datastructures that implement BinaryTree

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	RBTree<K,V> Realization of a dictionary by means of a red-black tree.

Methods in net.datastructures with parameters of type BinaryTree

void	LinkedBinaryTree.attach(Position<E> v, BinaryTree<E> T1, BinaryTree<E> T2) Attaches two trees to be subtrees of an external node.
void	LinkedBinaryTree.attach(Position<E> v, BinaryTree<E> T1, BinaryTree<E> T2) Attaches two trees to be subtrees of an external node.
abstract R	EulerTour.execute(BinaryTree<E> T) Execution of the traversal.