structure
Class RedBlackSearchTree

java.lang.Object
  |
  +--structure.AbstractStructure
        |
        +--structure.RedBlackSearchTree

All Implemented Interfaces:

OrderedStructure, Structure

public class RedBlackSearchTree

extends AbstractStructure

implements OrderedStructure

Red black trees, are binary trees that guarantee the following three properties.
1. Every child of every leaf is considered black
2. Every red node has two black children
3. Every path from a node to a descendant leaf contains the same number of black nodes.

These properties ensure that elements can be inserted, deleted, and located in logorithmic time.

Example usage:

To create a red-black tree containing the months of the year and to print out this tree as it grows we could use the following

 public static void main(String[] argv){
     RedBlackSearchTree test = new RedBlackSearchTree();
       
     //declare an array of months
     String[] months = new String[]{"March", "May", "November", "August", 
      			      "April", "January", "December", "July",
				      "February", "June", "October", "September"};
      
     //add the months to the tree and print out the tree as it grows
     for(int i=0; i < months.length; i++){
        test.add(months[i]);
        System.out.println("Adding: " + months[i] + "\n" +test.treeString());
      }
  }
 

See Also:

AVLTree, SplayTree, BinaryTree

Field Summary

protected int	count The number of nodes in the tree
protected RedBlackTree	root A reference to the root of the tree

Constructor Summary

RedBlackSearchTree()
Constructs a red-black search tree with no data

Method Summary

void	add(java.lang.Object value) Add a (possibly duplicate) value to the red-black tree, and ensure that the resulting tree is a red-black tree.
void	clear() Removes all data from the binary search tree
boolean	contains(java.lang.Object value) Determines if the red-black search tree contains a value
int	hashCode() Returns the hashCode of the value stored by this object.
boolean	isEmpty() Checks for an empty binary search tree
boolean	isRedBlack() Returns true iff this tree is a red-black tree.
java.util.Iterator	iterator() Returns an iterator over the red-black search tree.
java.lang.Object	remove(java.lang.Object value) Remove an value "equals to" the indicated value.
int	size() Determines the number of data values within the tree
java.lang.String	toString() Returns a string representing tree
java.lang.String	treeString() Returns a (possibly long) string representing tree.

Methods inherited from class structure.AbstractStructure

elements, values

Methods inherited from class java.lang.Object

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

Methods inherited from interface structure.Structure

elements, values

Field Detail

root

protected RedBlackTree root

A reference to the root of the tree

count

protected int count

The number of nodes in the tree

Constructor Detail

RedBlackSearchTree

public RedBlackSearchTree()

Constructs a red-black search tree with no data

Method Detail

isEmpty

public boolean isEmpty()

Checks for an empty binary search tree

Specified by:

isEmpty in interface Structure

Overrides:

isEmpty in class AbstractStructure

Returns:

True iff the tree contains no data

clear

public void clear()

Removes all data from the binary search tree

Specified by:

clear in interface Structure

size

public int size()

Determines the number of data values within the tree

Specified by:

size in interface Structure

Returns:

The number of nodes in the binary search tree

add

public void add(java.lang.Object value)

Add a (possibly duplicate) value to the red-black tree, and ensure that the resulting tree is a red-black tree.

Specified by:

add in interface Structure

Parameters:

value - the value to be added to the structure; non-null

remove

public java.lang.Object remove(java.lang.Object value)

Remove an value "equals to" the indicated value. Only one value is removed, and no guarantee is made concerning which of duplicate values are removed. Value returned is no longer part of the structure

Specified by:

remove in interface Structure

Parameters:

value - value matching the value to be removed

Returns:

Value to be removed from tree or null if no value removed

contains

public boolean contains(java.lang.Object value)

Determines if the red-black search tree contains a value

Specified by:

contains in interface Structure

Overrides:

contains in class AbstractStructure

Parameters:

value - non-null value to be found within structure

Returns:

True iff the tree contains a value "equals to" sought value

isRedBlack

public boolean isRedBlack()

Returns true iff this tree is a red-black tree. WARNING: This method executes in linear time and should not be frequently called during the process of insertion and deletion if the user wants

Returns:

True iff this tree is a red-black tree.

iterator

public java.util.Iterator iterator()

Returns an iterator over the red-black search tree. Iterator should not be used if tree is modified, as behavior may be unpredicatable Traverses elements using in-order traversal order

Specified by:

iterator in interface Structure

Returns:

An iterator over red-black search tree

See Also:

AbstractIterator, Iterator, Enumeration, Structure.elements()

treeString

public java.lang.String treeString()

Returns a (possibly long) string representing tree. Differs from toString() in that toString() outputs a single line representation of the contents of the tree. treeString, however, prints out a graphical representations of the tree's structure.

Returns:

String representation of tree

toString

public java.lang.String toString()

Returns a string representing tree

Overrides:

toString in class java.lang.Object

Returns:

String representation of tree

hashCode

public int hashCode()

Returns the hashCode of the value stored by this object.

Overrides:

hashCode in class AbstractStructure

Returns:

The hashCode of the value stored by this object.