A circularly-linked list is a type of linked list in which the last node has a reference to the first node, creating a circular structure

Circularly-linked lists are useful for quickly traversing a list in either direction, as there is no head or tail node.

Circularly-linked lists have a constant-time insert and delete operation, but a linear-time search operation

In a circularly-linked list, there is no concept of a head or tail node, as the list is circular

Circularly-linked lists can be traversed starting at any node and following the next references

Circularly-linked lists are useful for implementing certain types of algorithms, such as round-robin scheduling

It is possible to implement a circularly-linked list using either a singly-linked list or a doubly-linked list