Open In App

Algorithms Quiz | SP Contest 4 | Question 5

Like Article
Like
Save
Share
Report

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


Last Updated : 01 Aug, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads