AI MCQ #208: Which data structure conveniently used to implement DFS?

by

Q208. Which data structure conveniently used to implement DFS?

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

✅ Correct Answer: A) Stacks

Explanation: DFS requires node to be expanded the one most recent visited, hence stack is convenient to implement.