Multiple choice

The Breadth First Search algorithm uses which of the following data structures to store intermediate results as it traverses the graph?

  1. Tree

  2. Linked list

  3. Stack

  4. Queue

  5. Set
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The Breadth First Search algorithm uses a queue data structure to store intermediate results as it traverses the graph.

Keep practicing — related questions