Vidyalelo
Data Structure · Q13

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 13

Q13

In BFS, how do you keep track of the nodes to be visited?

A.
Using a stack
B.
Using a priority queue
C.
Using a set
D.
Using a queue
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board