CircularLinkList, Demo

CircularLinkList:

class Node{
int data;
Node next;

Node(int d){
data = d;
}
}

public class CircularList {
Node Head;
Node Tail;

public void insert(int d){
Node newNode = new Node(d);
Node T =Head;
if(Head == null){
Head = newNode;
}
else{
newNode.next=T;
Tail.next=newNode;
Head=newNode;

}
}
public void display(){
    Node T=Head;
    System.out.println(T.data);
    T=T.next;
    while(T!=Head){
        System.out.println(T.data);
        T=T.next;
    }
}
}

////////////////////////////////////////

public class CircularListDemo {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        CircularList CL=new CircularList();
        for (int i=0; i<10; i++){
            CL.insert(i+1);
           
        }

    }

}