[Solved] CS314 Specification 9

Programming Assignment 9: 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.

• Placed online: Wednesday, April 7
• 20 points, ~2% of final grade.
• Due: no later than 11 pm, Thursday, April 22 (The week after exam 2.)
• General Assignment Requirements

The purposes of this assignment are:

1. implement a binary search tree
2. observe the behavior of binary search trees when adding data in no particular order and data already in sorted order

Description: Implement a binary search tree class. Make the data structure generic using Javas generics and parameterized data types. You are free to use the code we developed together in lecture, just put a comment stating the code came from lecture. If you did not attend lecture or take notes notes during lecture, you shall develop the code on your own. I expect you to use the simple insertion algorithm we developed in class. Like assignment 1, you may not look up algorithms, in this case for balanced binary search trees. You may not use the TreeSet or TreeMap classes from the Java standard library when implementing your Binary Search Tree. You will use the Java TreeSet class in some experiments.

Provided Files:

BinarySearchTree.java is class that implements a binary search tree as discussed in lecture. It is acceptable to use the naive insertion and removal algorithms. 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. This method is already done and can be useful in debugging. Read the documentation for 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 of a BSTNode object 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.

Note: The get(int kth), getAllLessThan(E val), and 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 getAll method but you will very likely fail some stress tests if you take that approach. You must stop your search or processing as soon as you can. Dont do any extra work.

Submission: Complete the header in the BinarySearchTree and BSTTester classes. Replace <NAME> with your name. Note, you are stating, on your honor, that you did the assignment on your own.

Create a zip file name a9.zip with your BinarySearchTree.java and BSTTester.java files. The zip file must not contain any directory structure, just the required file.

See this page for instructions on how to create a zip via Eclipse.

Turn in a9.zip via your Canvas account to programming assignment 9.

• Ensure you files are named BinarySearchTree.java and BSTTester.java.. Failure to do so will result in points off.

• Ensure BinarySearchTree.java and BSTTester.java are part of the default package. Do not add a package statement to either file.

• Ensure your zip has no internal directory structure. When the file is unzipped no directories (folders) are created. (Note, the built in unzip feature of some versions of Windows and Apple OS X help by adding a directory when you unzip with the same name as the file. The unzip we use on the CS Linux system does not do this. Neither do unzip programs such as 7zip.)

• Ensure you submit the assignment under Programming Assignment 9 in Canvas.

• We will compile and run our tester harness on the CS department Linux machines. To ensure you have no problems (strange imports, package statements) I suggest you move your files to a directory on your CS department account and compile and run them from the command line.