Circular list

From Wikipedia, the free encyclopedia

In computer science, a circular list is a linked list whose tail is linked to its head, meaning the list can be endlessly traversed and any node can be reached by following the 'next' pointer.