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?

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Data Structure and Algorithms (DSA)

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?

(A) 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.
(B) it is not possible to add a node at the end of the list.
(C) it is difficult to traverse the list as the pointer of the last node is now not null
(D) all of above

💬 Discuss

✅ Correct Answer: (C) it is difficult to traverse the list as the pointer of the last node is now not null

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

117

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate