Please help me implement the two search functions in BinarySearchTree.java

public class BinarySearchTree> {

TreeNode root; /** * Insert given node to this binary search tree. If this tree * is empty, the given node becomes the root of this tree. * @param newNode the given node to be inserted */ public void insert(TreeNode newNode){ } /** * Insert given data to this binary search tree. If this tree * is empty, the given node becomes the root of this tree. * @param data the given data to be inserted */ public void insert(E data){ }

}