Advanced
Data Structures & Algorithms
Q96 / 100
What is the Fibonacci heap and its advantage over binary heaps?
Correct! Well done.
Incorrect.
The correct answer is B) It achieves O(1) amortized insert and decrease-key (vs O(log n) for binary heaps), improving Dijkstra's to O(E + V log V)
B
Correct Answer
It achieves O(1) amortized insert and decrease-key (vs O(log n) for binary heaps), improving Dijkstra's to O(E + V log V)
Explanation
Fibonacci heaps support O(1) amortized insert and decrease-key, O(log n) amortized delete-min. This makes Dijkstra O(E + V log V) with Fibonacci heap vs O(E log V) with binary heap.
Progress
96/100