Breadth First Search

The Breadth First Search (BFS) is an algorithm for traversing or searching tree or graph data structures. It explores all the nodes at the present depth before moving on to the nodes at the next depth level.

Resources

• https://www.educative.io/edpresso/what-is-breadth-first-search