Data Structure – Circular Single Linked List

Concept:
It is just a single linked list in which the link field of the last node points back to the address of the first node. A circular linked list has no beginning and no end. It is necessary to establish a special pointer called start pointer always pointing to the first node of the list. Circular linked lists are frequently used instead of ordinary linked list because many operations are much easier to implement. In circular linked list no null pointers are used, hence all pointers contain valid address

A circular single linked list is shown in figure 3.6.1.

figure-3-6-1-circular-single-linked-list

The basic operations in a circular single linked list are:

  •  Creation.
  • Insertion.
  • Deletion.
  • Traversing.

 
You may be interested in:
Data Structures and Algorithms – MCQs.
Data Structures and Algorithms Online Tests