Csc 220 - Data Structures

Project 2

Due: Tuesday, October 17, 2006

Three Types of Important Trees

Assignment

You will be supplied with three specialized programming environments for three important types of trees, a Heap, a B-Tree, and a Red-Black Tree.  You will also be given an executable file that contains a working implementation of that tree, so you can see the correct behavior.  The programming environment will be complete except for actual implementation of the tree. You must implement the tree code so that the program correctly implements the tree data structure.

Requirements

You must use the supplied programs to implement your tree data structures, and they must behave according to accepted standards for that data type.  Your code must implement the trees directly, without using any libraries or collection classes.  However, you are not required to conform to a particular style of code, as long as it actually implements the data structure. 

Grading

Project 2 is worth 22 points toward the final grade.  It will be graded according to the criteria on the Project 2 Grade Report. 

Date

Your project will be interactively graded on Tuesday, October 17th.  On Thursday, October 12th each student will sign up for a specific 20 minute period for grading on the following Tuesday.  You may have your project graded before October 17th, if you wish, by making arrangements with the instructor.