Consider the following binary search tree: Which of the following sequences correctly represents an inorder traversal of this tree?
A)A, C, H, G, E, N, P, M, J
B)J, E, M, C, G, P, A, H, N
C)A, C, E, G, H, J, M, N, P
D)J, E, C, A, G, H, M, P, N

Question

Consider the following binary search tree:  Which of the following sequences correctly represents an inorder traversal of this tree? 
A)A, C, H, G, E, N, P, M, J 
B)J, E, M, C, G, P, A, H, N 
C)A, C, E, G, H, J, M, N, P 
D)J, E, C, A, G, H, M, P, N

Quizplus · Accepted Answer

An inorder traversal visits the left subtree first, then the root, and then the right subtree. Starting from the root, we can see that the left subtree contains nodes with keys less than 11eb9782_fe17_8930_b9fe_0db05a62d42a_TB7392_00 and the right subtree contains nodes with keys greater than 11eb9782_fe17_8930_b9fe_0db05a62d42a_TB7392_00.

Traversing the left subtree, we get to node C (key: 0dc882a4_2304_7acf_96ac_8114a4b4c4de_TB7392_00), then node A (key: 0df674f8_fdef_59c2_b612_1e6c1bb80647_TB7392_00). Moving back up to the root, we then visit node H (key: 173d6361_cb43_2dd7_0f23_75cff6d46c58_TB7392_00), followed by its left subtree containing nodes E (key: 1728fc5e_eb1d_63ce_5b28_8c1d289947d0_TB7392_00) and G (key: 173cbabf_0121_f05f_8a62_dd9dbdfeacc7_TB7392_00). Continuing on to the right subtree, we visit node N (key: 2b2f3c38_ea3d_457c_16f8_21db481a5857_TB7392_00) and its left subtree containing nodes M (key: 2b11f77f_1fc4_697a_76e7_210fd409bc94_TB7392_00) and J (key: 2b2f3c38_ea3d_457c_16f8_21db481a5857_TB7392_00). Finally, we visit node P (key: 2b11f77f_1fc4_697a_76e7_210fd409bc94_TB7392_00).

The correct order of keys is thus: A, C, E, G, H, J, M, N, P. The only option that represents this order is choice C.

Consider the Following Binary Search Tree: Which of the Following