Q. The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be (Solved)
1. T Q R S O P
2. T O Q R P S
3. T Q O P S R
4. T Q O S P R
- c. T Q O P S R
1. T Q R S O P
2. T O Q R P S
3. T Q O P S R
4. T Q O S P R