java实现有序链表

package com.liu.Link;
//测试类
class SortedListApp
{
    public static void main(String args[])
    {
        SortedList theSortedList = new SortedList();
        theSortedList.insert(40);
        theSortedList.insert(20);
        theSortedList.displayList();
        
        theSortedList.insert(10);
        theSortedList.insert(15);
        theSortedList.insert(50);
        theSortedList.displayList();
        
        theSortedList.remove();
        theSortedList.displayList();
        
    }
}





//有序链表实现类
public class SortedList {
    private Link5 first;
    public SortedList(){
        first = null;
    }
    public boolean isEmpty()
    {
        return first==null;
    }
    public void insert(long d){
        Link5 newLink = new Link5(d);
        Link5 previous = null;
        Link5 current = first;
        
        while(current!=null&&d>current.dData){
            previous = current;
            current = current.next;
        }
        //当有序链表是一个空表时
        if(previous == null)
        {
            first = newLink;
        }else
        {
            previous.next = newLink;
        }
        newLink.next = current;
    }
    
    public Link5 remove()
    {
        Link5 temp = first;
        first = first.next;
        return temp;
    }
    
    public void displayList()
    {
        System.out.print("List (first-->last):");
        Link5 current = first;
        while(current!=null)
        {
            current.displayLink();
            current = current.next;
        }
        System.out.println("");
    }
}
//有序链表数据类
class Link5
{
    public long dData;
    public Link5 next;
    public Link5(long d){
        dData = d;
    }
    public void displayLink(){
        System.out.print(dData+" ");
    }
}