The maximum must be among the leaves, whose count is about n/2. A min-heap imposes no ordering between leaves, so locating their maximum needs a linear number of comparisons in the worst case. Scanning the leaves attains that bound. Thus Θ(n), C.
More Binary Heaps questions
GATE 2026 CS (CS1) Q23– Let n be an odd number greater than 100. Consider a binary minheap with n elements stored…
GATE 2025 CS (CS1) Q35– The height of any rooted tree is defined as the maximum number of edges in the path from…
GATE 2024 CS (CS1) Q41– An array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the…
GATE 2024 CS (CS1) Q43– Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the…
GATE 2023 CS Q12– Which one of the following sequences when stored in an array at locations A[1],...,A[10]…
GATE 2023 CS Q46– Let A be a priority queue for maintaining a set of elements. Suppose A is implemented…