Binary Tree animation applet

Inputs
Only positive, single to double digit integers are allowed (e.g. "37" or "3"). Incorrect types of data are ignored by the applet.
Insert
Insert an integer in the binary tree. Node comparisons will appear in the bottom panel of the applet.
Search
Search for an integer in the binary tree. Node comparisons will appear in the bottom panel of the applet, including whether or not the requested node exists within the binary tree.
Delete
Delete an integer in the binary tree. Node comparisons will appear in the bottom panel of the applet, including whether or not the requested node can be deleted from the binary tree (i.e. if it exists within the tree or not).

NOTE: The current implementation is slow. You may be required to wait several seconds befor the animation begins. This is a bug I plan to fix in the future.

Quelle: http://www.cs.jhu.edu/~goodrich/dsa/trees/btree.html

Last Modified: Mon Jul 14 16:02:09 1997

John Kloss <jkloss@hops.cs.jhu.edu>