Circular linked list in Data Structure

Rumman Ansari   Software Engineer   2023-03-27   7033 Share
☰ Table of Contents

Table of Content:


Circular Linked List

  1. Circular Linked List is Divided into 2 Categories .
    • I. Singly Circular Linked List
    • II. Doubly Circular Linked List
  2. In Circular Linked List Address field of Last node contain address of “First Node“.
  3. In short First Node and Last Nodes are adjacent .
  4. Linked List is made circular by linking first and last node , so it looks like circular chain [ shown in Following diagram ].
  5. Two way access is possible only if we are using “Doubly Circular Linked List
  6. Sequential  movement is possible
  7. No direct access is allowed.

Singly Circular Linked List:

Doubly Circular Linked List: