Write code in Java :

Implement a program to take n input integera and construct a binary search tree to atore these

numbers. Your code should do this by initializing a tree containing the firgt 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 keedelef, right$).$

and with $"$e$"$ being used in place of left if there is no left child or right if there ia no right child.

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

Consider using the Class ghowadede as well as the following two pseudocode samples:

Implement the Range Query method for BST$,$ using the pacudocode below. Show $2$ different

test cases using a tree with n$=20.$

flodalloBeoge$($k$1,$ k$2)$: should return all the elementa stored

in T with bey k auch that k k k$2$

Erample: output for

Byaceuse $30,70)$ on

the tree above would

be $(33,44,55,66)$