The post-order and in-order traversal of a Binary tree generates the same output. Then the tree is :
MH SET - 2025, SET Exam - 2025,
Answer: D
The tree is left skewed.
Inorder visits left subtree, node, right subtree; postorder visits left subtree, right subtree, node. The two orders agree only if no node has a right subtree, because then both reduce to 'left subtree, then node'. A binary tree in which every node has only a left child is left skewed.
In a right-skewed tree the inorder sequence runs from root to leaf and postorder from leaf to root, the reverse of each other. Any balanced tree with two or more levels has right children, so its orders differ.
Please log in or register to report this question.