Question

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

• A. We can traverse the whole circular linked list by starting from any point
• 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. Every node has a successor

Answer 1

The correct option is B Time complexity of inserting a new node at the head of the list is O(1)

Time complexity of inserting a new node at the head of the list is O(n) because you have to traverse through the list to find the tail node.