AVL Tree lab
CPE 103

The goal of ths lab is to repeat the experiment in the BST lab only using an AVL tree.  In theory we should see improved performance. 

These instructions will not explain every detail of the procedure.  Some steps have been intentionally omitted. You will have to figure out some of it on your own.

Weiss provides an implementation of AVL tree that you should use.

Download and compile the Weiss components and fix any errors.
source code

Copy the BSTdriver from the previous lab into a new file AVLdriver.   Modify AVLdriver so it works with the AVL tree class.

Test the AVL tree class to be sure it works correctly.

Now repeat the Huck Finn words experiment, recording the procedure and observations in your lab notebook.  
How long does the AVL tree take versus the BST?
How high is the AVL tree versus the BST?
What if we sorted the huck finn words file? What results would you predict?
Use the Unix "sort" command to sort the data and repeat the experiment. Do the results match your predictions? Describe your observations and conclusions in your lab notebook.