P2: BST Generic
P2: BST Generic

 

Due Date: Monday, Sept. 21, 2015, 23:59:59
Weight: 5%

The purpose of the second assignment is for students to implement a generic binary search tree container class.  Use the sample data input/output files below to test your program throughly before submitting it to the Curator.

P2 Binary Search Tree Generic (PDF format)

Sample sets of I/O files are available for testing:

Project Files: BST.java Test code (zip)

Downloading Sample Input/Output Files

To download a file, right-click on the link. Select "Save Target As..." or "Save Link As...", choose a directory to save the file, and save it.

A student's curator submission that receives the highest score will be graded for adherence to these requirements, whether it is the last submission or not. If two or more submissions are tied for highest, the earliest of those will be graded. Therefore: implement and comment your source code with these requirements in mind from the beginning rather than planning to clean up and add comments later. There are no exceptions to this policy!

 

The CS 3114 programming projects are individual work. Each submission must be pledged by including the commented posted pledge in the submitted file. The Va Tech Honor Code is in effect for all submitted work in CS 3114.
"On my honor, I have neither given nor received unauthorized aid on this assignment."

Computer Science 3114 Data Structures and Algorithms
D. Barnette