blogspot.software_and_algorithms.stern_library.data_structure

Class OrderLinkedRedBlackTree<T>

java.lang.Object

blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree<T>

blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree<T>

All Implemented Interfaces:

Iterable<T>

public class OrderLinkedRedBlackTree<T>
extends RedBlackTree<T>

A red black tree that has been augmented to support linear time partial iteration by storing pointers to a node's predecessor and successor within the node itself.

Author:

Kevin L. Stern

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	OrderLinkedRedBlackTree.Node<T> A red-black tree node augmented to store pointers to its predecessor and successor.

Constructor Summary

Constructors

Constructor and Description
OrderLinkedRedBlackTree() Default constructor.
OrderLinkedRedBlackTree(Comparator<T> comparator) Construct a new instance which uses the specified comparator.

Method Summary

Modifier and Type	Method and Description
void	clear() Clear all entries from this tree.
protected RedBlackTree.Node<T>	createNewNode(T value) Create a new node with the specified value.
RedBlackTree.Node<T>	delete(T value) Delete the specified value from this tree.
protected void	exchangeValues(RedBlackTree.Node<T> node, RedBlackTree.Node<T> successor) Called by RedBlackTree.delete(T) when the node to be removed is a leaf.
RedBlackTree.Node<T>	getFirstNode() Get the node containing the smallest value held by this tree.
RedBlackTree.Node<T>	getPredecessor(RedBlackTree.Node<T> node) Get the predecessor of the specified node.
RedBlackTree.Node<T>	getSuccessor(RedBlackTree.Node<T> node) Get the successor of the specified node.
RedBlackTree.Node<T>	insert(T value) Insert the specified value into this tree.

Methods inherited from class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree

contains, fixAfterDeletion, fixAfterInsertion, getNode, getRoot, getSize, isEmpty, iterator, leftRotate, rightRotate, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

OrderLinkedRedBlackTree

public OrderLinkedRedBlackTree()

Default constructor.

OrderLinkedRedBlackTree

public OrderLinkedRedBlackTree(Comparator<T> comparator)

Construct a new instance which uses the specified comparator.

Parameters:

comparator - the comparator to use when ordering elements.

Method Detail

clear

public void clear()

Clear all entries from this tree.

Overrides:

clear in class RedBlackTree<T>

createNewNode

protected RedBlackTree.Node<T> createNewNode(T value)

Create a new node with the specified value. This method allows a subclass to assert control over the type of the nodes held by this tree.

Overrides:

createNewNode in class RedBlackTree<T>

Parameters:

value - the value to apply to the new node.

Returns:

a new node holding the specified value.

delete

public RedBlackTree.Node<T> delete(T value)

Delete the specified value from this tree.

Overrides:

delete in class RedBlackTree<T>

Parameters:

value - the value to delete.

Returns:

the node which contained the value before it was removed from this tree, null if the value is not an element of this tree.

exchangeValues

protected void exchangeValues(RedBlackTree.Node<T> node,
                              RedBlackTree.Node<T> successor)

Called by RedBlackTree.delete(T) when the node to be removed is a leaf. In this case, the node's value is exchanged with its successor as per the typical binary tree node removal operation. This method allows a subclass to influence value exchange behavior (e.g. if additional node information needs to be exchanged).

Overrides:

exchangeValues in class RedBlackTree<T>

Parameters:

node - the node whose value is to be removed.

successor - the node to actually be removed.

getFirstNode

public RedBlackTree.Node<T> getFirstNode()

Get the node containing the smallest value held by this tree.

Overrides:

getFirstNode in class RedBlackTree<T>

Returns:

the node containing the smallest value held by this tree.

getPredecessor

public RedBlackTree.Node<T> getPredecessor(RedBlackTree.Node<T> node)

Get the predecessor of the specified node. The predecessor of a node n is the node with the largest value in the tree smaller than the value held by n.

Overrides:

getPredecessor in class RedBlackTree<T>

Parameters:

node - the node compared to which predecessor node will be found

Returns:

the predecessor of the specified node

See Also:

"CLRS"

getSuccessor

public RedBlackTree.Node<T> getSuccessor(RedBlackTree.Node<T> node)

Get the successor of the specified node. The successor of a node n is the node with the smallest value in the tree larger than the value held by n.

Overrides:

getSuccessor in class RedBlackTree<T>

Parameters:

node - the node compared to which successor node will be found

Returns:

the successor of the specified node

See Also:

"CLRS"

insert

public RedBlackTree.Node<T> insert(T value)

Insert the specified value into this tree.

Overrides:

insert in class RedBlackTree<T>

Parameters:

value - the value to insert.

Returns:

the new node containing the specified value if the value was not already present in the tree, null otherwise.