Intermediate
Data Structures & Algorithms
Q41 / 100
What is the time complexity of Dijkstra's algorithm using a binary heap?
Correct! Well done.
Incorrect.
The correct answer is B) O(E log V)
B
Correct Answer
O(E log V)
Explanation
With a binary heap priority queue, each edge relaxation takes O(log V) for the heap update. Total: O((E + V) log V), simplified to O(E log V) for connected graphs.
Progress
41/100