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 the above

Question

Quizplus · Accepted Answer

C) Answers A, B and D are not True. This list uses no more memory than an ordinary linked list, adding a Node at the end requires the same amount of effort as before, and a header Node would be no different than before. However, answer C is True, the decision of whether there is another Node in the list or not can no longer be determined by testing (next = = null) since the last Node's next field is equal to head instead of null.

A Variation of a Linked List Is a Circular Linked