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
When I was studying using NPTEL videos by IITD (by Dr. Naveen Garg), I wrote down in my notes that inorder traversal is only applicable for binary trees; not applicable for generic trees wherein the degree of nodes is greater than $2$. But, I am not sure whether the professor actually said so, or it was what I understood. Any comments?
For this problem, I considered both traversal sequence (given below), and ended up getting $A$ as the answer. Is this approach correct?
Geeksforgeeks has given the answer to this as A.
(A) the inorder traversal order of a ternary tree is left $\rightarrow $ root $\rightarrow $ middle $\rightarrow $ right.
@Gate Keeda according to Inorder
preorder should be root-left-middle-right & postorder should be left-middle-right-root.
Is that corect??
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'.
Preorder: When you visit the node the first time we can print the node
In order: When you visit the node the second time we can print the node
Postorder: When you visit the node the third time we can print the node
@Lakshman Patel RJIT : for post order it is not clear, how do we visit G & H third time, we could only visit second time, can yiu explain ??
@Lakshman Patel RJIT How to use dummy nodes in n-ary trees (n>2) like in this question?
this trick will work for a binary tree.
It's good to follow the actual procedure.
If you have some question than apply similar to a binary tree and check it out.
Feedback for next edition (if ever there's...