The following are the result of a tree traversal:

Pre-order list of nodes: A, F, H, K, G, Y, B

In-order list of nodes: F, K, H, A, Y, G, B

Post-order list of nodes: K, H, F, Y, B, G, A

(a) Draw the binary tree with the following list of nodes:

Pre-order list of nodes: A, F, H, G, K, Y, B

In-order list of nodes: H, F, G, A, K, B, Y

(b) Draw the binary tree with the following list of nodes:

In-order list of nodes: H, Q, G, Y, D, A, F

Post-order list of nodes: H, G, Q, A, F, D, Y

K