Discussion Forum

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?

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.

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

It is difficult to traverse the list as the pointer of the last node is now not NULL

All of above

Answer: C . It is difficult to traverse the list as the pointer of the last node is now not NULL
0Shares
0 0

If you think the posted answer is wrong or Confused About the Answer? Ask for Details Here

Know Explanation? Add it Here
we’ll review your comment and contact you soon….

Leave a Reply

Your email address will not be published. Required fields are marked *

error: You are not allowed to do so.....
0Shares
0
Scroll to Top