You will need to "write" 4 classes, BinarySearchTree, AVLTree, RedBlackTree, and SplayTree. you will be evaluating 4 different types of trees to see which one is better in a variety of situations. You will take implementations of an AVL tree, a red-black tree, a splay tree, and a regular BST, and see which ends up having better runtimes. The files have been provided for your convinience. There is also a requirements file attached with the source code files of the four trees, please feel free to take a look at them. Most of the work has been done, you only need to make final touches to the source code. Try to keep it as simple and easy to understand. The code must be submitted with documentation.
The report of the analysis of runtimes is also required with the source code. further details are in requirements file.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Complete ownership and distribution copyrights to all work purchased.
the source code should be JDK 1.4.x compatible.