![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
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) |
View all MCQs in
Data Structures (DS)No comments yet