Circular-linked lists

In the previous section, you have learned about the double-linked list. As you can see, the implementation of such a data structure allows for navigating between the nodes using the Previous and Next properties. However, the Previous property of the first node is set to null, as is the Next property of the last node. Do you know that you can easily expand this approach to create the circular-linked list?

Such a data structure is presented in the following diagram:

Here, the Previous property of the first node navigates to the last one, while the Next property of the last node navigates to the first. This data structure can be useful in some specific cases, as you will see while developing a real-world example.

Note

It is worth mentioning that the way of navigating between nodes does not need to be implemented as properties. It can also be replaced with methods, as you will see in the example within the following section.

Implementation

After the short introduction to the...