A circular linked list is one in which the next field for the last link node of the list points to the first link node of the list. This can be useful when you wish to have a relative positioning for...

A circular linked list is one in which the next field for the last link node of the list points to the first link node of the list. This can be useful when you wish to have a relative positioning for elements, but no concept of an absolute first or last position. (a) Modify the code of Figure 4.8 to implement circular singly linked lists. (b) Modify the code of Figure 4.14 to implement circular doubly linked lists.

Figure 4.8

Figure 4.14