Question

The data structure required
sor breath first traversal on a graph​

Answer 1

Answer:

Breadth First Search (BFS) algorithm traverses a graph in a breadthward motion and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

PLS MARK ME AS BRILLIANT OR FOLLOW ME