Uses of Interface
components.binarytree.BinaryTree
Package
Description
Provides the
BinaryTree
family interfaces and implementing classes.-
Uses of BinaryTree in components.binarytree
Modifier and TypeClassDescriptionclass
BinaryTree1<T>
BinaryTree
represented as a recursive data structure, done "bare-handed", with implementations of primary methods.class
Layered implementations of secondary methods forBinaryTree
.Modifier and TypeMethodDescriptionfinal void
BinaryTree1.assemble
(T root, BinaryTree<T> left, BinaryTree<T> right) void
BinaryTreeKernel.assemble
(T root, BinaryTree<T> left, BinaryTree<T> right) Assembles inthis
a tree with root labelroot
and subtreesleft
andright
; the declaration notwithstanding, the dynamic type ofleft
andright
must be the same as the dynamic type ofthis
.final T
BinaryTree1.disassemble
(BinaryTree<T> left, BinaryTree<T> right) BinaryTreeKernel.disassemble
(BinaryTree<T> left, BinaryTree<T> right) Disassemblesthis
into its root label, which is returned as the value of the function, and subtreesleft
andright
; the declaration notwithstanding, the dynamic type ofleft
andright
must be the same as the dynamic type ofthis
.void
BinaryTree.inOrderAssemble
(T root, BinaryTree<T> left, BinaryTree<T> right) Assembles inthis
a tree that has the same in-order traversal as a tree with root labelroot
and subtreesleft
andright
; the declaration notwithstanding, the dynamic type ofleft
andright
must be the same as the dynamic type ofthis
.void
BinaryTreeSecondary.inOrderAssemble
(T root, BinaryTree<T> left, BinaryTree<T> right) final void
BinaryTree1.transferFrom
(BinaryTree<T> source)