AI MCQ #207: Which data structure conveniently used to implement BFS?

by

Q207. Which data structure conveniently used to implement BFS?

  • a) Stacks
  • b) Queues
  • c) Priority Queues
  • d) All of the mentioned

✅ Correct Answer: B) Queues

Explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.