Task $-1$:

Write a java program to implement the following algorithms for Binary Search Tree. $($Assume the tree only contains integer keys$).$Write the following methods in java and test them in the main$($ method.

BSTInsert $($T$,x)$

TreeMinimum $($x$)$

TreeMaximum $($x$)$

TreeSearch $(x,k)$