Which data structure is primarily used by Breadth First Search (BFS) to explore nodes level by level?
Options
- A. Queue
- B. Stack
- C. Priority queue based only on heuristic value
- D. More than one of the above
- E. None of the above
Quiz Practice:
A. Queue
Breadth First Search (BFS) explores nodes level by level. It normally uses a FIFO queue, where nodes discovered earlier are expanded before nodes discovered later.