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
Answer:B
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
Explanation:Since you must traverse the list to reach the tail node, the time complexity of adding a new node at the top of the list is O(n).