A heap must also be a complete binary tree; A violates completeness. C has child eight below parent five, and D has children exceeding their parents. B is complete and satisfies every parent-child comparison. Therefore B.
More Binary Heaps questions
GATE 2015 CS (CS2) Q22– A complete binary tree has max-heaps as the left and right subtrees of its root. Which…
GATE 2015 CS (CS3) Q30– Find the minimum number of interchanges needed to convert the level-order array…
GATE 2021 CS (CS2) Q12– A binary min-heap of n elements is stored in an array. Find the worst-case complexity of…
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…
