All Classes and Interfaces

Class	Description
A234Tree<Key extends Comparable<Key>>	Simple implementation of 2-3-4-trees based on KTreeNode.
A234TreeExample	example: insert entries
A234TreeTest
AbstractQueue<T>	Interface for an ADT queue.
AbstractStack<T>	Interface for an ADT stack.
AtomicExpression	Superclass for data associated with a tree node.
AtomicExpression.Type	type identifiers returned by AtomicExpression.getType()
AVLTree<Key extends Comparable<Key>,Value>	Simple implementation of an AVL tree.
AVLTreeExample	example: insert entries and maintain balance
AVLTreeTest
BinarySearchTree<Key extends Comparable<Key>,Value>	Base class for a binary search tree.
BinarySearchTree.Visitor	visitor for traversing the tree in preorder
BinarySearchTreeExample	example: insert, remove, and restructure entries
BinarySearchTreeTest
BinaryTree<T>	Simple binary tree.
BinaryTreeTest
BinaryTreeTraversal<T>	Provide traversals of binary trees.
BinaryTreeTraversal	example: visualize binary tree traversal
BTree<Key extends Comparable<Key>>	Simple implementation of B-trees based on KTreeNode.
BTreeExample	example: insert entries
BTreeTest
Colormap<T>	simple interface for color map
ColormapCount	color map for (small) positive integer counts
ColormapJet	map values in [minValue,maxValue] to color
CommonGraphvizDecorator	Interface for simple decorator with preset properties
Divide	binary / operator: A/B
DList<T>	Implementation of a doubly linked list.
DListTest
DotViewer	Simple viewer for Graphvizable.
ExpressionParser	Simple expression parser.
ExpressionTree	Tree representation of arithmetic expression.
ExpressionTreeExample	ExpressionTree: minimal example
ExpressionTreeTraversal	example: visualize expression tree traversal
Graphviz	Use GraphViz to render graph structures.
Graphvizable	Interface for GraphViz rendering.
GraphvizDecorable	Interface for decorating items of Graphvizable objects.
GraphvizDecorator	Decorator for items of Graphvizable objects.
IterativePreorderTraversal	example: transform recursive preoder traversal to iterative algorithm
KTreeNode<Key extends Comparable<Key>>	Node in a k-ary search tree.
LexicalScanner	Base class for a simple lexical scanner.
LexicalScanner.Rule	a rule for lexical scanner
Minus	binary - operator: A-B
Number	Node representing constant number.
Operator	Node representing operator in an expression tree.
PermutationIterator	Iterator over all permutations of length n.
Permutations	Generate permutations.
Plus	binary + operator: A+B
Queue<T>	Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array.
QueueDL<T>	Impementation of AbstractQueue based on doubly linked list DList.
QueueTest
RedBlackTree<Key extends Comparable<Key>,Value>	Simple implementation of a red-black tree.
RedBlackTreeExample	example: insert entries and maintain balance
RedBlackTreeTest
RenderTree	Utility for rendering various trees.
RunTests
SimpleDecorator	Example for a simple decorator.
SingleStepper	Simple framework for single stepping code.
SingleStepperDemo	Demonstrate use of SingleStepper
SList<T>	Implementation of a singly linked list.
SListTest
Stack<T>	Implementation of a stack based on Vector.
StackTest
SVGViewer	Simple SVG viewer based on Batik's SVGCanvas.
Symbol	Node representing a symbolic parameter, e.g., a varibale.
SyntaxError	signals syntax error during parsing a term
Sys	System related utilities.
Terminal	Node represents a terminal AtomicExpression.
Times	binary * operator: A*B
Tokenizer	Breaks input string into pieces ("tokens").
UnaryMinus	unary - operator: -A ("sign")
Vector<T>	Implementation of an array-based vector.
VectorTest
VerboseQueue<T>	A queue that outputs messages on VerboseQueue.enqueue(T) and VerboseQueue.dequeue().
VerboseStack<T>	A stack that outputs messages on push(T) and pop().