A variation of a linked list is a circular linked list where the last Node in the list has next = head rather than next = null. One problem with this type of list is that
A) it wastes memory space since head already points at the first Node, so the last one does not need to
B) there is no ability to add a new Node at the end of the list since the last Node points at the first Node
C) it is more difficult to traverse the list since the old terminating condition, (next == null), is no longer true for the last node
D) a header Node for this type of list is more complex
E) All of these

Question

Quizplus · Accepted Answer

With a circular linked list, it is more difficult to traverse the list since the old terminating condition, (next == null), is no longer true for the last node. The other options are not true as it does not waste memory space, you can add a new Node at the end of the list by changing the next pointer of the last Node, and the header Node is not more complex.

A Variation of a Linked List Is a Circular Linked