Uses of Class
cse1030.recursion.BinarySearchTree.Node

Uses of BinarySearchTree.Node in cse1030.recursion

Fields in cse1030.recursion declared as BinarySearchTree.Node

Modifier and Type	Field and Description
private BinarySearchTree.Node<E>	BinarySearchTree.Node.left
private BinarySearchTree.Node<E>	BinarySearchTree.Node.right
private BinarySearchTree.Node<E>	BinarySearchTree.root The root node of the binary search tree.

Methods in cse1030.recursion that return BinarySearchTree.Node

Modifier and Type	Method and Description
BinarySearchTree.Node<E>	BinarySearchTree.getRoot() Get the root node of the tree.
BinarySearchTree.Node<E>	BinarySearchTree.Node.left() Get the left child node; for testing purposes only.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.maximumInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that has the largest data element.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.minimumInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that has the smallest data element.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.predecessorInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that is the predecessor to the root of the subtree.
BinarySearchTree.Node<E>	BinarySearchTree.Node.right() Get the right child node; for testing purposes only.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.successorInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that is the successor to the root of the subtree.

Methods in cse1030.recursion with parameters of type BinarySearchTree.Node

Modifier and Type	Method and Description
private static <E extends Comparable<? super E>> void	BinarySearchTree.add(E element, BinarySearchTree.Node<E> subtreeRoot) Add an element to the subtree rooted at subtreeRoot.
private static <E extends Comparable<? super E>> boolean	BinarySearchTree.contains(E element, BinarySearchTree.Node<E> subtreeRoot) Returns true if the subtree rooted at subtreeRoot contains the given element, false otherwise.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.maximumInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that has the largest data element.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.minimumInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that has the smallest data element.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.predecessorInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that is the predecessor to the root of the subtree.
static <E> BinarySearchTree.Node<E>	BinarySearchTree.successorInSubtree(BinarySearchTree.Node<E> subtreeRoot) Find the node in a subtree that is the successor to the root of the subtree.
private static <E> String	BinarySearchTree.toString(BinarySearchTree.Node<E> subtreeRoot) Return a string representation of the subtree rooted at subtreeRoot.