What is the corresponding time complexity for different operations like insert at head, insert at tail, delete tail, searching for an element on circular doubly linked list?
(A) O(n), O(1), O(n), O(n)
(B) O(1), O(1), O(1), O(n)
(C) O(1), O(1), O(1), O(1)
(D) None of the above
Answer: (B)
Explanation: https://www.geeksforgeeks.org/doubly-circular-linked-list-set-1-introduction-and-insertion/
Quiz of this Question
Article Tags :
Recommended Articles