A new node is created with initialized data and next fields. When adding a node, if the head is null, the new node becomes the head and tail; otherwise, the new node is added as the tail and points to the existing head to form a circular linkage. To display a circular linked list, a current node pointer tracks from the head to each next node in turn, printing data until current loops back to the head.

1. Session 05
Circular Linked List – Create & Display

2. • A new node is created with data and next field initialize to a
value and null.
• It first checks whether the head is null, then it will insert the
node as the head.
• Both head and tail will point to the newly added node.
• If the head is not null, the new node will be the new tail, and
the new tail will point to the head as it is a circular linked list.
Circular Linked List - Creation

3. Circular Linked List - Creation

4. Circular Linked List - Creation

5. Circular Linked List - Creation

6. Circular Linked List - Creation

7. Circular Linked List - Creation

8. Circular Linked List - Creation

9. Circular Linked List - Display
• Define a new node 'current' that will point to the head.
• Print current.data till current will points to head
• Current will point to the next node in the list in each iteration.

10. Circular Linked List - Display

11. Circular Linked List - Display

12. THANK
YOU