顺序链表的构建

package DataStructureTestSinglyLinkedList;

public class SortedSinglyLinkedList<T extends Comparable<T>> extends SinglyLinkedList<T> {

	public SortedSinglyLinkedList()
	{
		super();
	}
	
	
	public  SortedSinglyLinkedList(T[] element)
	{
		super();
		if(element!=null)
			for(int j=0;j<element.length;j++)
				this.insert(element[j]);
	}
	
	public void insert(T x)
	{
		if(x==null)
			return;
		Node<T> front=this.head;
		Node<T> p=front.next;
		while(p!=null&&p.data.compareTo(x)<0)
		{
			front=p;
			p=p.next;
		}
		
		front.next = new Node<T> (x,p);
	}
	
	//覆盖父类方法并抛出异常
	public void insert(int i,T x)
	{
		throw new UnsupportedOperationException("insert(int i,T x)");
	}
	
	
	public void append(T x)
	{
		throw new UnsupportedOperationException("append(T x)");
	}
	
	public void  remove(T x)
	{
		if(x==null)
			return;
		Node<T> front= this.head;
		Node<T> p = front.next;
		while(p!=null&&p.data.compareTo(x)<0)
		{
			front=p;
			p=p.next;
		}
		
		if(p!=null&&p.data.compareTo(x)==0)
			front.next=p.next;
	}
}