Uses of Interface
components.binarytree.BinaryTree

Packages that use BinaryTree

Package	Description
components.binarytree	Provides the BinaryTree family interfaces and implementing classes.

Uses of BinaryTree in components.binarytree

Classes in components.binarytree that implement BinaryTree

Modifier and Type	Class	Description
class	BinaryTree1<T>	BinaryTree represented as a recursive data structure, done "bare-handed", with implementations of primary methods.
class	BinaryTreeSecondary<T>	Layered implementations of secondary methods for BinaryTree.

Subinterfaces with type arguments of type BinaryTree in components.binarytree

Modifier and Type	Interface	Description
interface	BinaryTreeKernel<T>	Binary tree kernel component with primary methods.

Methods in components.binarytree that return BinaryTree

Modifier and Type	Method	Description
final BinaryTree<T>	BinaryTree1.newInstance()

Methods in components.binarytree with parameters of type BinaryTree

Modifier and Type	Method	Description
final void	BinaryTree1.assemble(T root, BinaryTree<T> left, BinaryTree<T> right)
void	BinaryTreeKernel.assemble(T root, BinaryTree<T> left, BinaryTree<T> right)	Assembles in this a tree with root label root and subtrees left and right; the declaration notwithstanding, the dynamic type of left and right must be the same as the dynamic type of this.
final T	BinaryTree1.disassemble(BinaryTree<T> left, BinaryTree<T> right)
T	BinaryTreeKernel.disassemble(BinaryTree<T> left, BinaryTree<T> right)	Disassembles this into its root label, which is returned as the value of the function, and subtrees left and right; the declaration notwithstanding, the dynamic type of left and right must be the same as the dynamic type of this .
void	BinaryTree.inOrderAssemble(T root, BinaryTree<T> left, BinaryTree<T> right)	Assembles in this a tree that has the same in-order traversal as a tree with root label root and subtrees left and right; the declaration notwithstanding, the dynamic type of left and right must be the same as the dynamic type of this.
void	BinaryTreeSecondary.inOrderAssemble(T root, BinaryTree<T> left, BinaryTree<T> right)
final void	BinaryTree1.transferFrom(BinaryTree<T> source)