Java- Data Structures and Analysis- Balancing Binary Search Trees

PLEASE READ WORD DOC

• Prefered Netbeans

Grading requirements:

Design (20 points):

Employs Modularity (including proper use of parameters, use of local variables etc.) most of the time

Employs correct & appropriate use of programming structures (loops, conditionals, classes etc.) most of the time

Efficient algorithms used most of the time

Excellent use of object-oriented design

Functionality (20 points):

Program fulfills all functionality

All requirements were fulfilled

Extra effort was apparent

Test Plan (20 points):

Comprehensive test plan.

Documentation (20 points):

Excellent comments

Comprehensive lessons learned

Excellent possible improvements included

Excellent approach discussion and references