All Packages Class Hierarchy This Package Previous Next Index
Class DataStructures.RedBlackTree
java.lang.Object
|
+----DataStructures.RedBlackTree
- public class RedBlackTree
- extends Object
Implements a red-black tree.
Note that all "matching" is based on the compareTo method.
RedBlackTree(Comparable)
- Construct the tree.
find(Comparable)
- Find an item in the tree.
findMax()
- Find the largest item in the tree.
findMin()
- Find the smallest item the tree.
insert(Comparable)
- Insert into the tree.
isEmpty()
- Test if the tree is logically empty.
main(String[])
-
makeEmpty()
- Make the tree logically empty.
printTree()
- Print the tree contents in sorted order.
remove(Comparable)
- Remove from the tree.
RedBlackTree
public RedBlackTree(Comparable negInf)
- Construct the tree.
- Parameters:
- negInf - a value less than or equal to all others.
insert
public void insert(Comparable item)
- Insert into the tree. Does nothing if item already present.
- Parameters:
- item - the item to insert.
remove
public void remove(Comparable x)
- Remove from the tree.
Not implemented in this version.
- Parameters:
- x - the item to remove.
findMin
public Comparable findMin()
- Find the smallest item the tree.
- Returns:
- the smallest item or null if empty.
findMax
public Comparable findMax()
- Find the largest item in the tree.
- Returns:
- the largest item or null if empty.
find
public Comparable find(Comparable x)
- Find an item in the tree.
- Parameters:
- x - the item to search for.
- Returns:
- the matching item or null if not found.
makeEmpty
public void makeEmpty()
- Make the tree logically empty.
isEmpty
public boolean isEmpty()
- Test if the tree is logically empty.
- Returns:
- true if empty, false otherwise.
printTree
public void printTree()
- Print the tree contents in sorted order.
main
public static void main(String[] args)
All Packages Class Hierarchy This Package Previous Next Index