Abstract Data Types on Data Structure and Algorithms related Questions and Answers

Question :   Which of the following is false about a circular linked list? 1. Every node has a successor 2. Time complexity of inserting a new node at the head of the list is O(1) 3. Time complexity for deleting the last node is O(n) 4. None of the mentioned Answer :   2 - Time complexity of inserting a new node at the head of the list is O(1)