Which data structure is used to implement breadth-first search (BFS) of a graph?

2024

Answer: A. Queue — Breadth-first search (BFS) is implemented using a Queue. BFS visits the nodes in a graph level by level.

1. A.

   Queue

2. B.

   Stack

3. C.

   LinkedList

4. D.

   None of the above

Attempted by 863 students.