Example: Consider the following search tree. Traverse the nodes with breath$-$first, with depth$-$first, and

with cumulative lease cost heuristic.

Example: Consider the search algorithm that we studied and the following search tree. Explore the

algorithm and the search tree and demonstrate the followings.

$($a$)$ When the underlying data structure is a stack, the nodes are traversed based on depth$-$first strategy.

$($b$)$ When the underlying data structure is a queue, the nodes are traversed based on breath$-$first

strategy.

$($c$)$ When the underlying data structure is a priority queue where the node with lease cumulative

distance is searched first, the nodes are traversed based on the cumulative lease cost heuristic.