please solve this problem

Binary Tree Exercise:

Implement a Java class BinarySearchTree with methods for inserting, searching, and

deleting nodes. Illustrate the concept of method overloading by implementing two

search methods: one using recursive search and another using iterative search

techniques.

$$ Inserting Nodes: Start with the insert method. Consider the base case of an

empty tree and then decide to insert the new node in the left or right subtree

based on its value.

$$ Searching Nodes: Implement both iterative and recursive search methods. The

recursive method naturally follows the tree's structure, while the iterative method

may use a while loop to traverse nodes.

$$ Deleting Nodes: This is the most complex operation. Handle three cases:

deleting a leaf node, a node with one child, and a node with two children. For the

last case, you might want to find the in$-$order successor or predecessor.

$$ Method Overloading: Demonstrate overloading with the search methods by

implementing both recursive and iterative approaches.

Binary Tree Exercise: BinarySearchTree Class

public class BinarySearchTree $\{$

private Node root;

private class Node $\{$

int data;

Node left, right;

Node$($int value$)\{$

data $=$ value;

left $=$ right $=$ null;

$\}$

$\}$

$//$ YOUR CODE HERE

$//$ Method for demonstration purposes

public static void main$($String$[]$ args$)\{$

BinarySearchTree bst $=$ new BinarySearchTree$()$;

bst$.$insert$(50)$;

bst$.$insert$(30)$;

bst$.$insert$(70)$;

System.out.println$("$Is $30$ in the tree? $"+$

bst$.$search$(30))$;

$\}$

$\}$