Q.

What is the worst case time complexity of inserting a node in a doubly linked list?

A. O(nlogn)
B. O(logn)
C. O(n)
D. O(1)
Answer» C. O(n)
1.3k
0
Do you find this helpful?
8

View all MCQs in

Data Structures (DS)

Discussion

No comments yet