All Classes and Interfaces

Class	Description
AATree	An immutable AA tree that can draw itself.
AVLTree	An immutable AVL tree that can draw itself.
BinarySearchTree	An immutable binary search tree that can draw itself.
BinaryTree	An immutable binary tree that can draw itself.
BSTFrame	A Frame for creating and manipulating a data structure with functionality equivalent to a binary search tree.
BSTInterface	This interface is implemented by each of the data structures whose functionality is equivalent to a binary search tree.
Colorizer	An interface to encapsulate a mechanism for associating colors to Objects.
ConsList	An immutable linear recursive structure with a head, which is an Object, and a tail, which is a ConsList.
EmptyListException	An exception thrown when an attempt is made to access the head or tail of an emtpy ConsList.
EmptyTreeException	An exception thrown when an attempt is made to access the root or a child of an emtpy BinaryTree.
GenericConsList<E extends Serializable>	An immutable linear recursive structure with a head and a tail, which is a GenericConsList.
GenericStack<E extends Serializable>	A stack built from an immutable ConsList.
MonochromeViewer	An alternate entry point to the Search Tree Viewer to run the program in monochrome mode.
Node	The objects used as the nodes of trees in the BinaryTree class.
PatriciaTrie	An immutable Patricia trie that can draw itself.
RedBlackTree	An immutable red-black tree that can draw itself.
SplayTree	An immutable splay tree that can draw itself.
Stack	A stack built from an immutable ConsList.
TreeComponent	A component displaying a graphical representation of a tree.
TreeDrawing	An immutable high-level representation of a drawing of a tree.
TreeFrame	A frame for displaying a tree.
TreeInterface	This interface may be implemented by a tree in order to allow a TreeDrawing to be constructed from the tree.
Trie	An immutable trie that can draw itself.
Viewer	This is the driver class for the Search Tree Viewer.