Consider the following rooted tree with the vertex labeled $P$ as the root:
The order in which the nodes are visited during an in-order traversal of the tree is
(A) the inorder traversal order of a ternary tree is left $\rightarrow $ root $\rightarrow $ middle $\rightarrow $ right.
The inorder traversal of a ternary tree is given by Left > Root > Middle > Right.
But if you apply this traversal sequence on this tree, the order is SQPTWURV.
According to the answer given by various books, the answer is (A).
(A) can only be the answer if we consider 'S' to be the left child of 'Q', and 'W' to be the left child of 'U'.
yes sir TRUE... working on it :). But this...