1. A programmer would like to traverse the binary search tree shown in Fig. 2.

Fig 2

Compare the use of a breadth-first traversal and a depth-first (post-order) traversal on the binary search tree..

You should include the following in your answer:

• how each traversal works

• the order of the return values for each traversal.