How Do We Traverse a Tree?
There are two main ways to search a tree: Breadth First Search (BFS) and Depth First Search (DFS). This lesson explains these two search techniques alongside their implementations, and allows for a helpful comparison of the two methods.
To explain the concepts, the following tree will be used as an example:
