There is a modification to the Linked List called a circular linked list. There is a current node which links to the next node, etc. This continues on until the “last” node, which points back to the first node.
Circular lists work well where you need to always be pointing to the next element, and know that there will never be an end. Think of a round robin event, where you go from one player (node) to the next, and it loops back to the original player (node).
You can insert data into the list at any point in your circular list. Typically, a location is chosen, such as where the current pointer is, so that it will be the next one selected, or has just been, so that you will go through all of your data until you reach the end.
Modifying the Linked List to be a circular linked list is a fairly trivial process.
Circular Linked List was originally found on Access 2 Learn
