Assignment 3

CS 146
due October 30, 2001
100 points

Redo Assignment 2 (without the extra credit), but using a ThreadedAVL class that implements an AVL tree with threads, rather than a ThreadedBST class. Test with the main function in the file A3.java, obtainable from the class web site.

You may use the AVL code from the text or my solution to Assigment 2 -- giving proper credit, of course -- but keep in mind that the AVL algorithms of the text assume that there will be empty link values in the tree.

Do use a header node for your AVL tree. Also, make sure to document how your insertion & rotation methods handle threads.