CSC 320  Assignment 5 -  Last one

Due by class time 24 April 2006.  Program and report should be emailed, AVL 
exercise turned in via hard copy.

1. Using the algorithm discussed in class, insert nodes with the following keys 
into an AVL tree.  Rewrite the tree after every rotation. (3,4,5,9,8,7,1,2) 

2. a graphical Java application submitted as a .java file.  The application
reads integers from a data file and builds an AVL tree using those integers as 
keys. The data file should be specified at run time. The AVL tree should be 
represented on the frame.  After the tree is built, the user should be able to 
add to the tree and delete from the tree by entering an integer into a text 
field and clicking on an add or delete button.  You can reasonably limit the 
size of the tree to fit the frame.

3. A report, describing your java program, your classes and methods, the 
algorithms you used, plus any problems you had and how you solved them, and 
what you like the most about the program.  (This is part of your grade.)