A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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. None of the mentioned
Answer:Time complexity of inserting a new node at the head of the list is O(1)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: