Question
A programmer needs algorithms with many decrease-key operations, and the chosen structure has the property that it provides excellent amortized decrease-key performance. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Fibonacci Heap
Explanation:
Fibonacci Heap fits because it supports algorithms with many decrease-key operations and it provides excellent amortized decrease-key performance.
Both clues point to this choice.
Leave a Reply