Q. What differentiates a circular linked list from a normal linked list?

(A) you cannot have the ‘next’ pointer point to null in a circular linked list
(B) it is faster to traverse the circular linked list
(C) you may or may not have the ‘next’ pointer point to null in a circular linked list
(D) head node is known in circular linked list

💬 Discuss

✅ Correct Answer: (C) you may or may not have the ‘next’ pointer point to null in a circular linked list

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:13 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

266

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate