Uses of Class
blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node

Packages that use RedBlackTree.Node

Package	Description
blogspot.software_and_algorithms.stern_library.data_structure

Uses of RedBlackTree.Node in blogspot.software_and_algorithms.stern_library.data_structure

Subclasses of RedBlackTree.Node in blogspot.software_and_algorithms.stern_library.data_structure

Modifier and Type	Class and Description
protected static class	DynamicIntervalTree.Node<U extends Comparable<U>,T extends Interval<U>> A node for a dynamic interval tree is a red-black tree node augmented to store the maximum high endpoint among intervals stored within the subtree rooted at the node.
static class	OrderLinkedRedBlackTree.Node<T> A red-black tree node augmented to store pointers to its predecessor and successor.

Methods in blogspot.software_and_algorithms.stern_library.data_structure that return RedBlackTree.Node

Modifier and Type	Method and Description
protected RedBlackTree.Node<T>	RedBlackTree.createNewNode(T value) Create a new node with the specified value.
protected RedBlackTree.Node<T>	OrderLinkedRedBlackTree.createNewNode(T value) Create a new node with the specified value.
RedBlackTree.Node<T>	RedBlackTree.delete(T value) Delete the specified value from this tree.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.delete(T value) Delete the specified value from this tree.
RedBlackTree.Node<T>	RedBlackTree.getFirstNode() Get the node containing the smallest value held by this tree.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.getFirstNode() Get the node containing the smallest value held by this tree.
RedBlackTree.Node<T>	RedBlackTree.Node.getLeft() Get the left child.
RedBlackTree.Node<T>	RedBlackTree.getNode(T value) Get the node that holds the specified value.
RedBlackTree.Node<T>	RedBlackTree.Node.getParent() Get the parent.
RedBlackTree.Node<T>	RedBlackTree.getPredecessor(RedBlackTree.Node<T> node) Get the predecessor of the specified node.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.getPredecessor(RedBlackTree.Node<T> node) Get the predecessor of the specified node.
RedBlackTree.Node<T>	RedBlackTree.Node.getRight() Get the right child.
RedBlackTree.Node<T>	RedBlackTree.getRoot() Get the root of this tree.
RedBlackTree.Node<T>	RedBlackTree.getSuccessor(RedBlackTree.Node<T> node) Get the successor of the specified node.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.getSuccessor(RedBlackTree.Node<T> node) Get the successor of the specified node.
RedBlackTree.Node<T>	RedBlackTree.insert(T value) Insert the specified value into this tree.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.insert(T value) Insert the specified value into this tree.

Methods in blogspot.software_and_algorithms.stern_library.data_structure with parameters of type RedBlackTree.Node

Modifier and Type	Method and Description
protected void	RedBlackTree.exchangeValues(RedBlackTree.Node<T> node, RedBlackTree.Node<T> successor) Called by RedBlackTree.delete(T) when the node to be removed is a leaf.
protected void	RedBlackTree.exchangeValues(RedBlackTree.Node<T> node, RedBlackTree.Node<T> successor) Called by RedBlackTree.delete(T) when the node to be removed is a leaf.
protected void	OrderLinkedRedBlackTree.exchangeValues(RedBlackTree.Node<T> node, RedBlackTree.Node<T> successor) Called by RedBlackTree.delete(T) when the node to be removed is a leaf.
protected void	OrderLinkedRedBlackTree.exchangeValues(RedBlackTree.Node<T> node, RedBlackTree.Node<T> successor) Called by RedBlackTree.delete(T) when the node to be removed is a leaf.
protected void	RedBlackTree.fixAfterDeletion(RedBlackTree.Node<T> node) Re-balance the tree after a delete operation.
protected void	RedBlackTree.fixAfterInsertion(RedBlackTree.Node<T> node) Re-balance the tree after an insert operation.
RedBlackTree.Node<T>	RedBlackTree.getPredecessor(RedBlackTree.Node<T> node) Get the predecessor of the specified node.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.getPredecessor(RedBlackTree.Node<T> node) Get the predecessor of the specified node.
RedBlackTree.Node<T>	RedBlackTree.getSuccessor(RedBlackTree.Node<T> node) Get the successor of the specified node.
RedBlackTree.Node<T>	OrderLinkedRedBlackTree.getSuccessor(RedBlackTree.Node<T> node) Get the successor of the specified node.
protected void	RedBlackTree.leftRotate(RedBlackTree.Node<T> node) Perform a left rotate operation on the specified node.
protected void	RedBlackTree.rightRotate(RedBlackTree.Node<T> node) Perform a right rotate operation on the specified node.
protected void	RedBlackTree.Node.setLeft(RedBlackTree.Node<T> node) Set the left child.
protected void	RedBlackTree.Node.setParent(RedBlackTree.Node<T> node) Set the parent.
protected void	RedBlackTree.Node.setRight(RedBlackTree.Node<T> node) Set the right child.