Description: The following object network of a binary search tree is given:

Define the BinarySearchTree join type (getters and setters do not need to be implemented for simplicity).

-Write Java code that creates this set of objects in the main method of the BinarySearchTreeApplication class.

- Now add a recursive method to the BinarySearchTree class with the following signature, which prints all items stored in the tree to the console:

public static void printNodes(BinarySearchTree root)

The left child node should always be visited first, then its own value should be output and finally the right child node should be visited Finally, in the BinarySearchTreeApplication class, call this method with the root of the tree.

For the object mesh, the printNodes method should output the following to the console:

9, 13, 26, 45, 63, 94, 100, 102

- Add the method to the BinarySearchTree class

public void append(int newElement)

which is a new element according to the algorithm of slides 59 of the lecture

Basic Programming Concepts III: Added dynamic data structures.