CS 314 - Specification 10 - Binary Search Trees
Programming Assignment 10: Individual Assignment. You must complete this assignment on your own. You may not acquire from any source (e.g. another student or an internet site) a partial or complete solution to a problem or project that has been assigned. You may not show another student your solution to an assignment. You may not have another person (current student, former student, tutor, friend, anyone) “walk you through” how to solve an assignment. You may get help from the instructional staff. You may discuss general ideas and approaches with other students but you may not develop code together. Review the class policy on collaboration from the syllabus.
The purposes of this assignment are:
Description: Implement a binary search tree class. Make the data structure generic using Java's generics and parameterized data types. You are free to use the code we have developed together in lecture, just put a comment stating the code came from lecture. If you did not attend lecture or take notes you are expected to develop all the code on your own. You may not use the TreeSet or TreeMap classes from the Java standard library when implementing your Binary Search Tree. You will use the TreeSet class in some experiments.
When finished turn in your BST.java and BSTTester.java files (BSTTester will contain your answers to the questions and experiments in a comment) using the turnin program.
|Source Code||Stopwatch.java. Used to record times of experiments in questions.java.||Provided by me. Do not alter.|
|Implementation||BinarySearchTree.java An implementation of a binary search tree.||Provided by you and me. Mostly you.|
|Documentation||Javadoc for the BinarySearchTree class.||Provided by me.|
|Test code||BSTTester.java contains several tests for the BinarySearchTree class. You must ensure the tests are correct and your class must pass these tests. Delete the original tests. Add at least 2 more tests per method.||Provided by you and me.|
|Reflection||questions.txt Place your answers to these questions in a comment at the top of your BSTTester.java file.||Provided by me.|
BinarySearchTree.java is class that implements a binary search tree as discussed in lecture. I have specified the methods for the class. Complete the implementation under the constraints of the general requirements. There is a method named printTree which prints out a representation of the current tree. It is a horizontal representation. Read the documentation for other details.
BinarySearchTree.BSTNode. This is a class nested inside the BinarySearchTree class. Use instances of this class to store the data in the binary search tree. This is very similar to the BSTNode class presented in class, but now we are nesting it inside the BinarySearchTree class. This allows you to access the instance variables directly.
BSTTester.java contains several tests for the BinarySearchTree class. After you are sure the original tests are correct and that your class passes them, delete the original tests. Add at least 2 tests per method in the BinarySearchTree class.
questions.txt contains a number of questions to and experiments regarding your completed BinarySearchTree class. Place your answers in a comment at the top of your BSTTester class.
getAllGreaterThan(E val) methods shall be as efficient as
possible in terms of time and space. Meaning make the T(N) as small as
possible. You could use the
method but you will lose points if you take that approach. You must stop your
search or processing as soon as you can. Don't do any extra work.
Checklist: Did you remember to: