Package | Description |
---|---|
components.binarytree |
BinaryTree data structure component family and their implementations. |
Modifier and Type | Class and Description |
---|---|
class |
BinaryTreeNL<T>
BinaryTree implemented as a recursive data structure, not layered on
any other components. |
class |
BinaryTreeSecondary<T>
Abstract class providing the implementation of all of the layered secondary
methods that were defined in the
BinaryTree interface, as well as the
implementation for equals , toString , and hashCode
methods. |
Modifier and Type | Method and Description |
---|---|
BinaryTree<T> |
BinaryTreeKernel.leftSubtree()
Removes the left subtree from
this and returns it. |
BinaryTree<T> |
BinaryTreeKernel.rightSubtree()
Removes the right subtree from
this and returns it. |
static BinaryTree<java.lang.String> |
BinaryTreeUtility.treeFromString(java.lang.String str)
Builds a binary tree from the given string.
|
Modifier and Type | Method and Description |
---|---|
void |
BinaryTreeNL.build(T root,
BinaryTree<T> left,
BinaryTree<T> right) |
void |
BinaryTreeNL.build(T root,
BinaryTree<T> left,
BinaryTree<T> right) |
void |
BinaryTreeKernel.build(T root,
BinaryTree<T> left,
BinaryTree<T> right)
Builds
this into a Binary Tree with root as the root of
the tree, left as the left subtree of this , and right as the right subtree of this . |
void |
BinaryTreeKernel.build(T root,
BinaryTree<T> left,
BinaryTree<T> right)
Builds
this into a Binary Tree with root as the root of
the tree, left as the left subtree of this , and right as the right subtree of this . |
static <T> T |
BinaryTreeUtility.removeLeftMost(BinaryTree<T> t)
Removes and returns the left-most node in
t . |
static <T> T |
BinaryTreeUtility.removeRightMost(BinaryTree<T> t)
Removes and returns the right-most node in
t . |
void |
BinaryTreeNL.transferFrom(BinaryTree<T> source) |