Question

Given the following tree. Apply DFS and BFS as studied in the chapter. Show
the state of the data structure Q and the visited list clearly at every step. S is the
initial state and D is the goal state.
S
I
H
E D
G
F
C
B
A
S
I