java实现单向链表

package hello1;
public class LinkList<T> {
    private LinkList<T> head;
    private LinkList<T> tail;
    T data;
    private LinkList<T> next;

    public LinkList() {
        head = tail = null;

    }

    public LinkList(T data) {
        this.data = data;
        this.next = null;
    }


    public void insert(T data) {
        LinkList<T> li = new LinkList<T>(data);
        if (head == null) {
            head = li;
        }
        else if(tail==null){

            tail=li;head.next=tail;
        }
        else{
            li.next=head.next;
            head.next=li;
        }

    }

    public void printLinkList() {
        LinkList x = this.head;
        if(head==null||tail==null)
            System.out.println("empty");
        while (x!= null) {
            System.out.print(x.data + " ");
            x = x.next;
        }
        System.out.println();
    }

    public void delete(T data) {
        LinkList curr=head,pre=null;
        boolean f=true;
        while(curr!=null) {
            if (curr.data.equals(data)) {
                f = false;
                System.out.println(data+"删除成功");
                if (curr == head) {
                    head = head.next;
                } else if (curr == tail) {
                    tail = pre;
                    pre.next = null;
                } else {
                    pre.next = curr.next;
                }
            }
            pre = curr;
            curr = curr.next;
        }
        if(f)
            System.out.println("不存在"+data);

    }


    public static void main(String[] args) {
        LinkList<Integer> mylist = new LinkList<Integer>();
        mylist.insert(5);
        mylist.insert(6);
        mylist.insert(7);
        mylist.insert(3);
        mylist.insert(9);
        mylist.insert(8);
        mylist.printLinkList();
        mylist.delete(1);
        mylist.printLinkList();
        mylist.delete(8);
        mylist.printLinkList();
        mylist.delete(6);
        mylist.printLinkList();
    }

}