What is a Breadth-first search? If you have a tree structure as below and visit the root node, and then all of its children, and all of its children’s children, and so on, that’s a so-called Breadth-first search. In this case, the order will be: A => B => C...
