All Packages  Class Hierarchy  This Package  Previous  Next  Index

Interface DataStructures.SearchTree

public interface SearchTree

find(Comparable)

Find an item in the tree.

findMax()

Find the largest item the tree.

findMin()

Find the smallest item in the tree.

insert(Comparable)

Insert into the tree.

isEmpty()

Test if the tree is logically empty.

makeEmpty()

Make the tree logically empty.

printTree()

Print the tree contents in sorted order.

remove(Comparable)

Remove from the tree.

removeMin()

Remove the smallest item from the tree.

  public abstract void insert(Comparable x) throws DuplicateItem

Insert into the tree.

Parameters:

x - the item to insert.

Throws: DuplicateItem

if an item that matches x is already in the tree.

  public abstract void remove(Comparable x) throws ItemNotFound

Remove from the tree.

Parameters:

x - the item to remove.

Throws: ItemNotFound

if no item that matches x can be found in the tree.

  public abstract void removeMin() throws ItemNotFound

Remove the smallest item from the tree.

Throws: ItemNotFound

if the tree is empty.

  public abstract Comparable findMin() throws ItemNotFound

Find the smallest item in the tree.

Returns:

the smallest item.

Throws: ItemNotFound

if the tree is empty.

  public abstract Comparable findMax() throws ItemNotFound

Find the largest item the tree.

Returns:

the largest item.

Throws: ItemNotFound

if the tree is empty.

  public abstract Comparable find(Comparable x) throws ItemNotFound

Find an item in the tree.

Parameters:

x - the item to search for.

Returns:

the matching item.

Throws: ItemNotFound

if no item that matches x can be found in the tree.

  public abstract void makeEmpty()

Make the tree logically empty.

  public abstract boolean isEmpty()

Test if the tree is logically empty.

Returns:

true if empty, false otherwise.

  public abstract void printTree()

Print the tree contents in sorted order.

All Packages  Class Hierarchy  This Package  Previous  Next  Index