超级无敌，循环升序双链表

package DataStructureTestSinglyLinkedList;

public class SortedCirDoublyLinkedList<T extends Comparable<T>>extends CirDoublyLinkedList<T> {
			public SortedCirDoublyLinkedList()
			{
				super();
			}
			
			public SortedCirDoublyLinkedList(T[] element)
			{
				super();
				for(int j=0;j<element.length;j++)
				{
					this.insert(element[j]);
				}
			}
			
			public void insert(T x)
			{
				if(x==null)
					return;
				if(this.head.next!=this.head&&this.head.prev.data.compareTo(x)<0)
				{
					DLinkNode<T> q = new DLinkNode<T> (x,this.head.prev,this.head);
					this.head.prev.next=q;
					this.head.prev=q;
					return;
				}
				
				DLinkNode<T> p =this.head.next;
				while(p!=this.head&&p.data.compareTo(x)<0)
				{
					p=p.next;
				}
				
				DLinkNode<T> q= new DLinkNode<T>(x,p.prev,p);
				p.prev.next=q;
				p.prev=q;
			}
}