A circularly linked list is a list whose last node references the first node. The implementation works much like the singly linked list implementation except that, when traversing the list with temp, the last node of the list is found when.

temp.getNext() == first;

evaluates to true, Figure 29-5 illustrates a circularly linked list.

Figure 29-5

In addition, a doubly-circularly linked list can be implemented from a doubly-linked list.