For BFS of a graph, we should use:

For BFS of a graph, we should use:

  1. a) queue
  2. b) Stack
  3. c) priority queue
  4. d) Binary search tree

From the BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 31 of 123.

More from this paper