Which of the following is false about a circular linked list?

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Data Structure (DS)

Q. Which of the following is false about a circular linked list?

(A) Every node has a successor
(B) Time complexity of inserting a new node at the head of the list is O(1)
(C) Time complexity for deleting the last node is O(n)
(D) We can traverse the whole circular linked list by starting from any point

💬 Discuss

✅ Correct Answer: (B) Time complexity of inserting a new node at the head of the list is O(1)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

315

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate