Variations of the linked list
Circular linked list:
- Every node in a circular linked list has a successor.
- No node in a circular linked list contains a NULL pointer.
- Usually there is a external pointer to the last node (nor needed.)
- See example on Page 191, 192.