Let A be a priority queue for maintaining a set of elements. Suppose A is…
GATE · 2023 · CS · Computer Science & IT
Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation Extract-Max(A) extracts and deletes the maximum element from A. The operation Insert(A,key) inserts a new element key in A. The properties of a max-heap are preserved at the end of each of these operations.
When A contains n elements, which one of the following statements about the worst case running time of these two operations is TRUE?
- A.
Both Extract-Max(A) and Insert(A,key) run in O(1).
- B.
Both Extract-Max(A) and Insert(A,key) run in O(log(n)).
- C.
Extract-Max(A) runs in O(1) whereas Insert(A,key) runs in O(n).
- D.
Extract-Max(A) runs in O(1) whereas Insert(A,key) runs in O(log(n)).
Attempted by 256 students.
Show answer
Correct answer: B
Explore the full course: Iocl Engineers Officers Grade A Paper 2