Circular Linked List Data Structure and operations

Circular Linked List

A Circular Linked Data Structure will have nodes that have:

1. Data
2. Address which points to the next node
3. The last node in turn points to the starting node, therefore forming a chain

Circular Linked List in C++

struct Node 
{ 
    int data; 
    struct Node *next; 
};