12.Breadth-First Search (BFS)

BFS uses a Queue to keep track of which nodes to explore next. Definition BFS explores all nodes level by level starting from the root.It visits all nodes at depth 1, then depth 2, and so on.  Algorit