有序链表实现优先队列

package linklist;

import org.junit.Test;

public class QueLinkList {
    private Link head;
    private int length;

    public QueLinkList() {
        this.head = null;
    }

    public void insert(long dd){
        Link node = new Link(dd);
        Link current = head;
        Link previous = null;
        while(current != null && node.dData < current.dData){
            previous = current;
            current = current.next;
        }

        if(previous == null){
            head = node;
        }else{
            previous.next = node;
        }
        node.next = current;

    }

    public void remove(){
        Link current = head;
        current = current.next;
        head = current;
    }

    public Link find(long dd){
        Link current = head;
        while(current != null && current.next != null){

            if(current.dData == dd){
                return current;
            }

            current = current.next;
        }

        if (current.dData == dd){
            return current;
        }

        return null;
    }


    public boolean delete(long dd){
       Link current = head;
       Link previous = null;

       while (current != null){
           if (current.dData == dd){
               if(previous == null){
                   previous = current.next;
                   head = previous;
                   break;
               }else{
                   if (current.next == null){
                        previous.next = null;
                   }
                   previous.next = current.next;
               }
           }
           previous = current;
           current = current.next;
       }


       return false;
    }

    public void displayLinkList() {
        System.out.println("display start");
        Link current = head;
        while (current != null) {
            current.display();
            current = current.next;
        }
        System.out.println("display end");
    }

    public boolean isEmpty(){
        return this.head == null;
    }

    @Test
    public void test(){
        QueLinkList list = new QueLinkList();
        list.insert(80);
        list.insert(5);
        list.insert(77);
        list.insert(2);
        System.out.println(list.find(5l));

        list.remove();
        list.remove();
        list.displayLinkList();
    }
}