DFS and BFS functions on the tree performs the entire DFS/BFS and then returns the resulting vector.
This is inefficient for methods like find that should stop as soon as a result is found.