DFS-and-BFS Motivation: Preparation for Google interview. Aim: Implement Depth-first-search and Breadth-first-search on simple trees. Use: Run as found.