Circular Linked Lists are similar to doubly linked lists in that they have a previous and next part of the node. They can be implemented in a number of ways, some will link the first node with data to the tail, some will link the head to the tail. We will be learning the second way as it makes traversing the list easier to implement.
Circularly Linked Lists can be more efficient as well as helping tackle problems that are inherently circular, such as a representation of a Monopoly board.
