Visiting a tree or graph level by level, nearest nodes first, using a queue. It finds shortest paths in unweighted graphs.