CPSC 220 Fall 2007
Program 3: A Balanced Binary Search Tree

The goal of this program is to create a balanced binary search tree class with search and insertion capabilities. We will eventually (but not in this assignment) compare the performance of this class to our regular binary search tree class for the lookup-intensive problems we are addressing for the Regional Commission.

Your program should:

This program is due by 4:00 pm on Tuesday, November 20. E-mail me a tar file of your directory by that date and bring hardcopy with you to class on Monday, Nov 26. Because of the Thanksgiving holiday, late penalties will accrue at an adjusted rate: programs received by 4:00 pm on Sunday, Nov 25 will be counted one day late, and by Mon, Nov 26 as two days late.