BinarySearchTree.java

    public int contains(int searchVal) {
        Node pointer = this.getRoot();
        int depth = 0;
        while(pointer != null) {
            if(pointer.getData() == searchVal) {
                return depth;
            }
            if (pointer.getData() > searchVal) {
                pointer = pointer.getLeft();
            } else{
                pointer = pointer.getRight();
            }
            depth++;
        }
        return NOT_FOUND;
    }