Trees and Graphs

Question 1

Depth-first Search (DFS)

Answer 1

Pros:
* on a binary tree, it generally requires less memory than BFS
* Can easily be implemented with recursion

Cons:
* Doesn’t necessarily find the shortest path to a specific node, while BFS does

Implementation Data Structure:
* Stack (Last in First Out - LIFO)

Question 2

Breadth-First Search (BFS)

Answer 2

Pros:
* Will find the shortest path between the starting point and any other reachable node.

Cons:
* generally requires more memory than a DFS

Implementation Data Structure:
* Queue (First in First Out or FIFO)