Java菜鸟问题，求大神们耐心解答

Question

第一次在CDSN上提问，不知道有没有大神可以帮我看看：
这是我们这个星期的作业要求：
The Sorted List ADT
Implement the SortedList class. The SortedList class extends
the List class. Both can be seen here. Your assignment is to
implement (recursively) all of the abstract methods of the List class.
They are:
insert (recursive)
iterator
remove (recursive)
retrieve (recursive)
search (recursive)
You must also implement an Iterator inner class for the
SortedList class. You must submit a modified SortedList.java
file with your source code. Do not submit and do not modify
the List.java file.

然后我试着写了把retrieve，search和iterator方法都写出来了，唯有insert和remove（我想这两个应该差不多）写不出来，这是我试的代码，被报错，求大神们指点
public void insert(E data){
insert(head, data);

private insert(Node curr, data){
Node temp = new Node (data);
if (curr==null || data.compareTo(curr.data)<0){
temp.next=curr;
curr=temp;
break;
}
else{
continue;
}

return insert(curr.next, data);
}
return;
}

Answer 1

如果我是你我会如下
public void insert(Node pre,Node curr,T data){
if(pre = null&&curr==null){//这表示开始没有一个节点
curr = new Node(data);//其实这里还需要让 head = curr.这里设置java内存应用指向问题
return;
}

   if(curr.data.compareTo(data)>0){//这表示满足插入条件
        Node temp = new Node(data);
          if(pre!=null){
                    pre.next = temp;
                         temp.next = curr;
                  }else{
                      temp.next = curr;
                    }
    }
    if(curr.next!=null)//这表示它还没到最后
    insert(curr,curr.next,data);
    else{
    Node temp = new Node(data);
     temp.next = null;
    curr.next = temp;

    }

}

我知道你是想curr永远为头节点，但是你写的代码就不是你传入参数可以这眼 Node temp = head;
insert(null,temp,data)