Circular Linked List in Data Structures: Definition and Operations
☰Fullscreen
Table of Content:
Circular Linked List
- Circular Linked List is Divided into 2 Categories .
- I. Singly Circular Linked List
- II. Doubly Circular Linked List
- In Circular Linked List Address field of Last node contain address of “First Node“.
- In short First Node and Last Nodes are adjacent .
- Linked List is made circular by linking first and last node , so it looks like circular chain [ shown in Following diagram ].
- Two way access is possible only if we are using “Doubly Circular Linked List”
- Sequential movement is possible
- No direct access is allowed.
Singly Circular Linked List:
Doubly Circular Linked List:
No Questions Data Available.
- Assignment 1: C Program of circular linked list
- Assignment 2: C Program to concatenate two circular linked lists