Question
A programmer needs priority queue implementation, and the chosen structure has the property that only the root is guaranteed to contain the global minimum or maximum. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Heap
Explanation:
Heap fits because it supports priority queue implementation and only the root is guaranteed to contain the global minimum or maximum.
Both clues point to this choice.
Leave a Reply