Exercise 1

(i) Fill in the nodes of the above tree in the order they would be explored in a depth-first search (assume left to right traversal).

(ii) Compare depth-first searching to breadth-first searching. When are depth-first searches the superior choice and why? Give a real-world example.

Exercise 2

(iii) Fill in the nodes of the above tree in the order they would be explored in an iterative deepening search (again, assume left to right traversal).

(iv) Compare iterative deepening searching to breadth-first searching. When are iterative deepening searches the superior choice and why? Give a real-world example.