Java Binary Search Trees I have to implement an insert method for a binary search tree. Whats given is here public void insert(E key) throws DuplicateItemException {         try {                          CODE GOES HERE         }         catch (DuplicateItemException ex) {             throw ex;         }     } I need help with what goes there

Java Binary Search Trees

I have to implement an insert method for a binary search tree. Whats given is here

public void insert(E key) throws DuplicateItemException {
        try {
            
            CODE GOES HERE
        }
        catch (DuplicateItemException ex) {
            throw ex;
        }
    }

I need help with what goes there