All programs given below are provided as is and there is no warranty of any kind, either expressed or implied. We are not responsible for any damages caused by the running of these programs on any system.
Download the ZIP file and save it onto your computer. Extract all the files and you will see the source files. Run the make file to compile.
This program works fine and all features including deletion have been tested and work. Main.java is used to test the code. You may run Main.java which inserts and deletes nodes and then prints the tree. When I was researching the AVL tree, I found that many programs available on the Web do not work completely, or at least deletion of nodes does not work. However, all features of my program should work.
To learn more about AVL tree, you may use the following link, or search on Google for "AVL tree".
http://en.wikipedia.org/wiki/AVL_tree
See the README for more information.
Calculates the linear correlation for a set of n (x, y) points. Tested with g++.