BinarySearchTree (Part 1)

Part 1 - BinarySearchTree - Create an abstract class named BinarySearchTree in the cs312 package that extends the AbstractBinarySearchTree class as defined below. Please also include the two classes below in the [url removed, login to view] file, but note that you are NOT ALLOWED to change these two classes. class BinaryTreeNode { public BinaryTreeNode left; public BinaryTreeNode right; public BinaryTreeNode parent; public Integer value; } abstract class AbstractBinarySearchTree { BinaryTreeNode root; public abstract void add(Integer i); public abstract boolean exists(Integer i); public abstract String inorder(); public abstract String preorder(); public abstract String postorder(); } The BinarySearchTree class should implement all of the methods EXCEPT the "add(Integer)" method. That is why the class will still be declared abstract. The methods should be implemented to perform the necessary functionalities. For the inorder(), preorder(), and postorder() methods, make sure that the output is correct. I will use these methods to test the other methods in the class. Since we now have an abstract class named BinarySearchTree, we need to create another class that extends this class so that we can then use our method implementations. For this project, I need to create two different classes that extend the BinarySearchTree class. One of the classes will be named NaiveBinarySearchTree and the other will be named BalancedBinarySearchTree. Part 2 - NaiveBinarySearchTree - This class will extend the BinarySearchTree class that you wrote in Part 1. Please put this class in the cs312 package, and make the class public. For this class, you will implement the add method in the class. The reason this class is "naïve" is because when you add a value to the tree, you will add it in the easiest location. In other words, the algorithm for where to place this element will be as easy as comparing (see BinarySearchTree Part 2 on bids)

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.

## Platform

Windows NT 2000 Jbuilder Enterprise

## Deadline information

You must view the request for bid for BinarySearchTree (Part 2) to see the rest of this project. I can only put 2000 characters on each project, so I ran out of space. Please submit a bid for the entire project, not each bid request. Also, please include a comment in your response that you understand it is one project.

Inżynieria Java MySQL PHP Architektura oprogramowania Testowanie oprogramowania

Numer ID Projektu: #2900973

O projekcie