Circular Linked List

A Circular Linked List is one which has no beginning and no end. A singly linked list can be formed as a circular linked list by simply sorting the address of the very first node in the link field of the last node.

Circular Linked List is a variation of Linked list in which the first element points to the last element and the last element points to the first element. Both Singly Linked List and Doubly Linked List can be made into a circular linked list.

Singly Linked List as Circular Representation

In singly linked list, the next pointer of the last node points to the first node.