Breadth First Searching
The first, and one of the most common methods to search is using a breadth first search (BFS) pattern. In this case, you start at the root node of the tree, and evaluate the first child determining if you have a match. If not, you move to its sibling and then the next, until there…
