Multiple choice

Which of the following data structures is used by the Breadth First Search algorithm to store intermediate results as it traverses the graph?

  1. Linked list

  2. Heap

  3. Queue

  4. Stack

  5. B-Tree
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

BFS algorithm uses a queue data structure to store intermediate results as it traverses the graph.

Keep practicing — related questions