数据结构：有序链表

package none006有序链表;

public class SortedListApp {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		SortLinkList slist=new SortLinkList();
		slist.insert(20);
		slist.insert(10);
		slist.displayList();
		System.out.println();
		slist.insert(10);
		slist.insert(30);
		slist.insert(50);
		slist.displayList();
		System.out.println();
		slist.delete();
		slist.displayList();
	}

}
class Link{
	int idate;
	Link next;
	Link(int value){
		next=null;
		idate=value;
	}
	public void displayLink(){
		System.out.print(idate+" ");
	}
}
class SortLinkList{
	Link first;
	
	SortLinkList(){
		first=null;
	}
	public void insert(int value){
		Link previous,current;
		Link newLink=new Link(value);
		previous=null;
		current=first;
		while(current!=null&¤t.idate<value){
			previous=current;
			current=current.next;
		}
		if(previous==null){
			first=newLink;
		}else{
			 
			previous.next=newLink;
		}
			
		  
		newLink.next=current;
			
	}
	public Link delete(){
		if(first==null)
			return null;
		Link temp=first;
		first=first.next;
		return temp;
	}
	public boolean isEmpty(){
		return first==null;
	}
	public void displayList(){
		if(first==null){
			System.out.println("链表已经空了。。");
			return;
		}
		Link current=first;
		while(current!=null){
			current.displayLink();
			current=current.next;
		}
	}
}