1.

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(Log2N)
B. O(N)
C. O(N2)
D. Θ(N2 Log N)
Answer» D. Θ(N2 Log N)


Discussion

No Comment Found

Related MCQs