N items are stored in a sorted doubly linked list. For a delete operation, a…
N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the list in this order: Θ(N) delete, O(log N) insert, O(log N) find and Θ(N) decrease-key. What is the time complexity of all these operations put together?
- A.
O(log2 N)
- B.
O(N)
- C.
O(N2)
- D.
Θ(N2 log N)
Attempted by 35 students.
Sign up free to check your answer
Sign up freeLoading lesson…

