Name: ______________________

Three Types of Important Trees

Program fulfills all requirements:

3 Points: Your code compiles and runs in all three environments, even though possibly incomplete.
4 Points: Your code implements a Heap directly in code within the supplied environment.  
8 Points: Your code implements a B-Tree directly in code within the supplied environment.  
7 Points: Your code implements a Red-Black Tree directly in code within the supplied environment.  

                                                          Interactive Grade (22 points total) _______________
 

                                                                                                Final Grade _______________
 

Back to Project 2

Csc 220 - Data Structures, Fall 2006

Scott Badman   Office: B132   Phone: 353-2250   sbadman@parkland.edu

Parkland College, 2400 W. Bradley Avenue, Champaign, IL 61821