A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

Question

Admin · Accepted Answer

it is difficult to traverse the list as the pointer of the last node is now not null

Admin · Answer

it waste memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node.

Admin · Answer

it is not possible to add a node at the end of the list.

Admin · Answer

all of above

Q. A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

Discusssion