Algorithms | Graph Traversals | Question 12

What are the appropriate data structures for following algorithms?

1) Breadth-First Search                           
2) Depth First Search                            
3) Prim\’s Minimum Spanning Tree                 
4) Kruskal\’ Minimum Spanning Tree                

(A)

•  Stack
•  Queue
• Priority Queue
• Union Find

(B)

• Queue
• Stack
• Priority Queue
• Union Find

(C)

• Stack
• Queue
• Union Find
• Priority Queue 

(D)

• Priority Queue
• Queue
• Stack
• Union Find

Answer: (B)
Explanation:

• Breadth First Search uses Queue
• Depth First Search uses Stack
• Prim\’s Minimum Spanning Tree uses Priority Queue. 
• Kruskal\’ Minimum Spanning Tree uses Union Find.

Hence Option(B) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post