JAVA递归实现BST，求大神帮着改改

[nn970510]

要求JAVA递归实现BST二叉树的搜索，插入和删除。代码实在是不知道哪里错了求帮着改改。Main就不贴出来了
代码：

*
* BinaryTree.java
*
public abstract class BinaryTree<E> implements Iterable<E> {
protected class Node<T> {
protected Node(T data) {
this.data = data;
}
protected T data;
protected Node<T> left;
protected Node<T> right;
}
public abstract void insert(E data);
public abstract void remove(E data);
public abstract boolean search(E data);
protected Node<E> root;
}
*
* BinarySearchTree.java
*
import java.util.Iterator;
public class BinarySearchTree<E extends Comparable<? super E>> extends BinaryTree<E> {
private Node<E> findIOP(Node<E> curr) {
for (curr = curr.left; curr.right != null; curr = curr.right);
eturn curr;
}
public void insert(E data) {
Node<E> temp = new Node<E>(data);
root = insert(root, temp);
}
private Node <E> insert (Node<E> curr, Node<E> node) {
if (curr == null) {
curr = new Node(node.data);
return curr;}
else{
if (node.data.compareTo(curr.data) <= 0) {
curr.left=insert(curr.left, node);}
else {curr.right=insert(curr.right, node);}
}
return curr;}
public Iterator<E> iterator() { return null;}
public void remove(E data) {
Node<E> temp = new Node<E>(data);
remove (root, temp); }
private void remove (Node<E> curr,Node<E> node) {
if (curr != null && curr.left!=null && curr.right!=null) {
if (node.data.compareTo(curr.data) == 0) {
if (curr.left == null || curr.right == null) {
curr = curr.left != null ? curr.left : curr.right; }
else {
Node<E> iop = findIOP(curr);
curr.data = iop.data;
node.data = iop.data;
remove(curr.left, node); }
}
if (curr.data.compareTo(node.data) < 0) { remove(curr.right, node);}
else {remove(curr.left, node);}
}
else{return;} 
}
public boolean search(E data) {return search(root, data);}
private boolean search(Node<E> curr, E data){
if (curr != null) {
if (data.compareTo(curr.data) == 0) { return true;}
else if (data.compareTo(curr.data) < 0) {search(curr.left, data);}
else {search(curr.right, data);} 
}
else{ return false; } 
return false; }
}