| Interface | Description |
|---|---|
| TraversalTask<K,V> |
When we perform a traversal of a tree, we call the
performTask method to process each key,value pair in
the tree.
|
| Tree<K extends java.lang.Comparable<K>,V> |
This interface describes the interface for both empty and non-empty search
trees.
|
| Class | Description |
|---|---|
| EmptyTree<K extends java.lang.Comparable<K>,V> |
This class is used to represent the empty search tree: a search tree that
contains no entries.
|
| NonEmptyTree<K extends java.lang.Comparable<K>,V> |
This class represents a non-empty search tree.
|
| PlaceKeysValuesInArrayLists<K,V> |
This task places key/values in two arrays in the order
in which the key/values are seen during the traversal.
|
| PolymorphicBST<K extends java.lang.Comparable<K>,V> |
This class represents the polymorphic tree.
|
| Exception | Description |
|---|---|
| TreeIsEmptyException |
This is a checked exception, used internally by SearchTree nodes, to signal that a tree
has no minimum or maximum element.
|