AlgoMaster Logo

Breadth First Search (Iterative)

graph=[[1,2],[3,4],[5],[5],[5],[]],startNode=0
0 / 22
order001122334455startqueue
algomaster.io
Step:Start BFS from node 0 using a queue