Linked List Cycle - A Tile of Linked is Have a Next Pointer To Header

/*

Tail of linked list contains any of it node

is

known as circle linked list.

[10]=>[20]=>[30]----|

|====<===<====<===|

*/

//Instalize the class for list node

class node{

int data;

node next;

node(int data){

this.data=data;

}

}

class circleList{

node head;

node tail;

public void addNode(int data){

if(head==null){

head=new node(data);

tail=head;

}

else{

tail.next=new node(data);

tail=tail.next;

tail.next=head;

}

}

public void traverse(node head){

while(head!=null){

System.out.println(head.data);

head=head.next;

}

}

public static void main(String[] args){

circleList cl=new circleList();

cl.addNode(5);

cl.addNode(10);

cl.addNode(15);

}

}