Multiple choice Dijkstra's algorithm is an example of which of the following data structures? Queue Stack Priority queue Array None of these Reveal answer Fill a bubble to check yourself C Correct answer Explanation In Dijkstra's algorithm, we can alter the priority of a particular vertex in the priority queue efficiently.