Answer Happy

Question 4: BFS, DFS, and MST (20 pts). For below graph,
starting from node D
a) Please show how to use a stack to do a DFS and
draw the final DFS tree.
b) Please show how to use a queue to do a BFS and
draw the final BFS tree.
c) After deleting the maximum value, draw the
complete binary tree as well as the array of the
max-heap.
d) After inserting a new value 15, draw the
complete binary tree as well as the array of the
max-heap.