edu.princeton.cs.algorithms

Class RedBlackBST<Key extends Comparable<Key>,Value>

java.lang.Object

edu.princeton.cs.algorithms.RedBlackBST<Key,Value>

public class RedBlackBST<Key extends Comparable<Key>,Value>
extends Object

Constructor Summary

Constructors

Constructor and Description
RedBlackBST()

Method Summary

Methods

Modifier and Type	Method and Description
Key	ceiling(Key key)
boolean	contains(Key key)
void	delete(Key key)
void	deleteMax()
void	deleteMin() Red-black deletion
Key	floor(Key key)
Value	get(Key key) Standard BST search
int	height() Utility functions
boolean	isEmpty()
Iterable<Key>	keys() Range count and range search.
Iterable<Key>	keys(Key lo, Key hi)
static void	main(String[] args) Test client
Key	max()
Key	min() Ordered symbol table methods.
void	put(Key key, Value val) Red-black insertion
int	rank(Key key)
Key	select(int k)
int	size() Size methods
int	size(Key lo, Key hi)

Methods inherited from class java.lang.Object

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

Constructor Detail

RedBlackBST

public RedBlackBST()

Method Detail

size

public int size()

Size methods

isEmpty

public boolean isEmpty()

get

public Value get(Key key)

Standard BST search

contains

public boolean contains(Key key)

put

public void put(Key key,
       Value val)

Red-black insertion

deleteMin

public void deleteMin()

Red-black deletion

deleteMax

public void deleteMax()

delete

public void delete(Key key)

height

public int height()

Utility functions

min

public Key min()

Ordered symbol table methods.

max

public Key max()

floor

public Key floor(Key key)

ceiling

public Key ceiling(Key key)

select

public Key select(int k)

rank

public int rank(Key key)

keys

public Iterable<Key> keys()

Range count and range search.

keys

public Iterable<Key> keys(Key lo,
                 Key hi)

size

public int size(Key lo,
       Key hi)

main

public static void main(String[] args)

Test client