GATEverse Practice, past papers & mock tests
GATE 2016 · CS2 - Afternoon
Programming & Data StructuresLinked ListmediumMCQ1 mark
N items are stored in a sorted doubly linked list. For delete, a pointer to the record is provided. For decrease-key, a pointer to the record is provided. An algorithm performs in order: Θ(N) delete, O(log N) insert, O(log N) find, and Θ(N) decrease-key. What is the total time complexity?
Save your progress

Related Programming & Data Structures PYQs