LearnFrenzy
Sign in Take a free test

Data Structures in Java · Data Structures in Java MCQ · Question 4

The structure that drives breadth-first search Answer, explanation & discussion

  • MCQ
  • Easy
  • 0 comments
  • Answer explained
  • Moderated community
Question 4 Back to Exercise

Which data structure does breadth-first search (BFS) use to decide which vertex to visit next?

  • A Stack
  • B Heap
  • C Queue Correct
  • D Trie
Correct Answer: Option C

The FIFO queue makes BFS finish one level before starting the next.

Discussion & Comments 0

Share your method, a shortcut, or ask about a step you didn't follow.

No comments yet. Be the first to share your solution!

Post your comment

Comments appear after a quick review by our team.

Search LearnFrenzy

Esc

Quick links