Queues as a circular list
A linear linked list is specified by two pointers, one to the front and one to the rear of the list.
Using a circular list a queue may be specified by a single pointer to the list.
This pointer points to the rear of the list and the pointer -> next points to the front.