$|||$Part $2$: BinarySearchTree Class

Interface

For this project, you are also to create a wrapper BinarySearchTree Class. In reality, this class doesn't do that much. The

class simply starts recursion of the root itself.

Naturally, there is some logic needed to handle an null root, but that is just a few basic if$-$statements.

public class BinarySearchTree

BinarySearchTree$()$ Constructor.

Node root Private

string about$()$ Returns text about you $$ the author of this class.

string toTree$()$ Returns a string of the tree$$s structure.

It will start recursion from the root node with indent $0$ and a label of

"Root".

String toSortedList$()$ Returns a string sorted by the key. Please see below.

It will start recursion from the root node.

void add$($int key, String value$)$ Adds the key to the correct position in the BST$.$ If the key already

exists, do nothing.

string find$($int key$)$ Finds a node with the key and returns the value. If the node is not

found, you can return an empty string.$|||$

Pseudocode

class BinarySearchTree

private Node root

$...$ All your methods go here.

end class

In java programming, please include comments and picture of the result. Thank you.