Explain Circular Linked List With Example And Program.
Circular Linked List
A linked list in which the last node points to the first node is called a circular linked list
In a circular linked list with more than one node, it is convenient to make the pointer first point to the last node of the list
The first node in the linked list is accessible through by a reference,we can print or search in the linked list by starting at the first item and following the chain of the references. Insertion and deletion can be performed arbitrary.
We must perform the following steps:
Tmp=new ListNode( );// create a new node
Tmp.element=x; //place x in the element field.
Tmp.next=current.next; // x’s next node is B
Current.next=temp; //a’s next node is x