Question
A programmer needs repeatedly retrieving the largest element, and the chosen structure has the property that the maximum element is stored at the root. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Max-Heap
Explanation:
Max-Heap fits because it supports repeatedly retrieving the largest element and the maximum element is stored at the root.
Both clues point to this choice.
Leave a Reply