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

McqMate

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
Answer» B. Time complexity of inserting a new node at the head of the list is O(1)

2.9k

0

Do you find this helpful?

23

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs

Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
What differentiates a circular linked list from a normal linked list?
What differentiates a circular linked list from a normal linked list?
Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
Which of the following application makes use of a circular linked list?
The disadvantage in using a circular linked list is …………………….
A circular linked list can be used for
The disadvantage in using a circular linked list is …………………….
How do you count the number of elements in the circular linked list?