Which of the following is useful in traversing a given graph by Breadth-First…

Correct data structure: Queue (FIFO) . Why: BFS explores nodes level by level. A queue (first-in, first-out) ensures that nodes discovered earlier are processed before nodes discovered later, producing the breadth-first order. Initialize the queue with the start node and mark it visited.