Java Programming

$1.$ Implement a program to take n input integers and construct a binary search tree to store these numbers. Your code should do this by initializing a tree containing the first integer to serve as the root, and then reading each subsequent integer, creating a node for it$,$ and inserting each node into the tree. Then, print out the tree. When printing each node, it should print as key$($left$,$ right$),$ and with $$e$$ being used in place of left if there is no left child or right if there is no right child.

$$

Example input: $6,4,8,2,7,3,1$

Example output: $6(4,8)$; $4(2,$ e$)$; $2(1,3)$; $1($e$,$ e$)$; $3($e$,$e$)$; $8(7,$ e$)$; $7($e$,$ e$)$

$$

Consider using the Class BinaryNode, as well as the following two pseudocode samples:

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$2.$ Implement the Range Query method for BST$,$ using the pseudocode below. Show $2$ different test cases using a tree with n $=20.$

$$

findAllInRange$($k$1,$ k$2)$: should return all the elements stored in$$T$$with key$$k$$such that$$k$1$ k $$ k$2.$

Example: output for RangeQuery$(30,70)$ on the tree above would be $\{33,44,55,66\}$

$$

$$

$$