In Breadth-first search (BFS) or level-order search, the search tree is broadened as much as possible before going to the next depth.

(“Tree Traversal” 2022)

Bibliography

“Tree Traversal.” 2022. Wikipedia, April. https://en.wikipedia.org/w/index.php?title=Tree_traversal&oldid=1083604462.