Binary Search Tree Viewer

Note: For a more recent version of this program (requiring Java v. 1.2), click here. Below is an applet for creating and manipulating Binary Search Trees and AVL Trees. Select one of the choices from the choice box, and press the Start button. This will open a window in which the tree can be created. To create and manipualte a tree, enter any string in the text field in the lower left-hand corner, and press either the Put button to add that string as a key to the tree, or the Remove button to remove that key from the tree. The keys will be maintained in lexicographic order. The Back and Forward buttons allow you to move through the history of your tree construction. The Clone button opens a new window with an exact copy of the tree and history in your current window; the tree in this window can then be manipulated independently.

Disclaimers and known bugs

This applet is written using Java version 1.1, and so does not work on many browsers. However, it will run as a stand-alone program as well. If you have JDK 1.1, you may wish to download the applet. Alternatively, you can run the applet with appletviewer without downloading anything explicitly:
```
appletviewer http://www.cis.ksu.edu/~howell/viewer.new/viewer.html
```
Sometimes on Windows 95 (and perhaps NT), the tree does not appear in the window. By manually resizing the window - first shrinking it, then stretching it - you can make the tree appear. I think this is a Java bug, but I've not yet found a work-around. However, the bug is fixed in the Java 1.2 version.

Send bug reports to howell@cis.ksu.edu, but please don't tell me it puts the keys in the wrong order. It treats keys as strings and orders them lexicographically; e.g., "5" > "10".