In a breadth-first traversal of a graph, what type of collection is used in the generic algorithm?
A) queue
B) set
C) stack
D) heap

Question

Quizplus · Accepted Answer

In breadth-first traversal, we first visit all the nodes at a given depth level before moving to the next level. This behavior is managed efficiently with a queue data structure, where nodes are added to the end of the queue and removed from the front, following a First-In-First-Out (FIFO) pattern. Therefore, the best choice is a queue.

In a Breadth-First Traversal of a Graph, What Type of Collection