In a graph, which traversal technique uses a queue?

A. Depth First Search (DFS)
B. Breadth First Search (BFS)
C. Dijkstra’s Algorithm
D. Prim’s Algorithm

Explanation:

BFS uses a queue to traverse nodes level by level.

Tags: Algorithms MCQ , Computer Science