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 value of the root of the tree?
A) I
B) U
C) T
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. Therefore, the last node visited in the postorder traversal is the root of the tree. In this case, the last character in the sequence is 'I', making it the root of the tree.

If the Postorder Traversal Visits the Nodes of a Binary