A Fibonacci heap is a heap data structure similar to the binomial heap. It uses Fibonacci numbers and also used to implement the priority queue element in Dijkstraβs shortest path algorithm which reduces the time complexity from O(m log n) to O(m + n log n)