Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX}(A)$ extracts and deletes the maximum element from $A$. The operation $\text{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?

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?

Topic-wise GATE CS PYQs with verified steps