If the postorder traversal visits the nodes of a binary tree storing character values in the order of U, G, T, R, A, I, what is the visit order for an inorder traversal of the same binary tree?
A) I, G, U, A, T, R
B) R, G, U, I, T, A
C) G, U, I, T, A, R
D) cannot be determined

Question

Quizplus · Accepted Answer

In postorder traversal, the nodes are visited in the order of left subtree, right subtree, and then the root. Given the postorder sequence U, G, T, R, A, I, the root is I. The left subtree is U, G, and the right subtree is T, R, A. In inorder traversal, the nodes are visited in the order of left subtree, root, and then right subtree, resulting in G, U, I, T, A, R.

If the Postorder Traversal Visits the Nodes of a Binary