P1: B S T
P1: B S T

 

Due Date: Monday, Sept. 25, 2017, 23:59:59

The purpose of the first assignment is for students to refamiliarize themselves with text file parsing of a non-trivial input set and to implement a generic Binary Search Tree.  Use the sample data input/output files below to test your program throughly before submitting it to Web-CAT.

P1 Binary Search Tree (BST) (PDF format)

P1 command output formats (PDF)

Sample sets of I/O files available for testing:

Test
Set
Input
File
Output
File
1 SyntaxTest SyntaxTestOutput
2 SimpleInsertionTest simpleInsertion_output
3 RegionSearchTest regionSearch_output

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 last Web-CAT submission for an assignment will be graded for adherence to the assignment specification, design and documentation requirements, whether it is the highest submission or not. Thus the last submission, not the highest submission, will constitute a student's grade on an assignment. Therefore: if you make a submission near the deadline that is lower than your previous submission your score on the assignment does NOT revert to your highest submission. There are no exceptions to this policy!

 

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