Exercise#$1$: Implement Binary Search Tree

Given the following implementation of tree. implement the following methods for a Binary Search Tree.public void insert$($int val$)$: This method should insert a value into the Binary Search Tree $($BST$).$ If the value already exists, do nothing.public void delete$($int val$)$: This method should delete a value from the BST$.$ If the value does not exist, do nothing. Ensure the BST properties are maintained after deletion.public void printIncreasingOrder$($: This method should print the values in the BST in increasing order. Use in$-$order traversal to achieve this.public void printDecreasingOrder$0$: This method should print the values in the BST in decreasing order. Use a modified in$-$order traversal $($visit right subtree first$)$ to achieve this.public int findMin$0$: This method should return the minimum value in the BST$.$ Assume the BST is not empty.public int findMin$($: This method should return the maximum value in the BST$.$ Assume the BST is not empty.