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

Question

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

Quizplus · Accepted Answer

Preorder traversal means visiting the root node first, then the left subtree, and then the right subtree recursively. The root node in this tree is J, and the left subtree has E as its root node and the right subtree has M as its root node. So, the correct sequence would be J, E, A, G, C, H, M, P, N. This sequence matches with option (C).

Consider the Following Binary Search Tree: Which of the Following