What is the difference between a Binary Heap and a Fibonacci Heap? Why is Fibonacci Heap theoretically faster for Dijkstra's?

0-2 years experience

1. 1If you need to implement a priority queue for a simple scheduler that only supports insert and extract‑min, which heap would you choose and why?
2. 2Suppose you have an array of 100 integers and you build a binary heap in place. What happens to the heap property if you swap the root with the last element without re‑heapifying?
3. 3How would you use a binary heap to find the k smallest elements in a stream of numbers?

2-5 years experience

1. 1Your team replaced a binary heap with a Fibonacci heap in the Dijkstra implementation, but the runtime got worse on small graphs. What could be causing the slowdown?
2. 2While debugging a routing service, you notice that decrease‑key operations are taking longer than expected. How would you verify whether the heap implementation is the bottleneck?
3. 3You need to support frequent edge‑weight updates in a graph algorithm. Explain the trade‑offs between using a binary heap versus a Fibonacci heap for the priority queue.

5-8 years experience

1. 1Design the priority‑queue component of a large‑scale navigation system that must handle millions of concurrent shortest‑path queries. How would you decide between binary and Fibonacci heaps, and what hybrid approach might you use?
2. 2When scaling Dijkstra’s algorithm across a distributed cluster, what heap‑related issues arise, and how would you mitigate them?
3. 3If you had to refactor an existing codebase that uses a binary heap to improve amortized performance for many decrease‑key calls, what architectural changes would you make and what risks would you watch for?

8+ years experience

1. 1Your company is migrating a legacy routing engine that uses binary heaps to a new platform that prefers Fibonacci heaps for theoretical speed. How would you plan the migration to minimize regression risk and maintain cross‑team compatibility?
2. 2At an organization level, how would you evaluate whether adopting Fibonacci heaps in core graph libraries is worth the engineering overhead, considering future feature roadmaps and hardware trends?
3. 3Explain how you would instrument and monitor heap performance in production to decide if the theoretical advantages of Fibonacci heaps are realized in real traffic.