題組內容

5.Basic Data Structures:

(1) Consider a binary tree. Suppose that its DFS result is "c, b, e, f, d, h, i, g, k, a, j" while BFS result is "c, b, g, e, d, k, j, f, h, i, a". Please draw the tree.