Breadth First Search

Breadth first search is a graph traversal algorithm that starts at the root node and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

Visit the following resources to learn more:

• BFS and DFS in a Binary Tree
• Breadth-First Search (BFS) and Depth-First Search (DFS) for Binary Trees in Java
• Breadth-first search in 4 minutes