The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?

The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree? Correct Answer L N M O Q P T

The tree generated by using given pre-order and in-order traversal is Thus, L N M O Q P T will be the post-order traversal.
Bissoy MCQ

Related Questions

Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences. S1: N, M, P, O, Q S2: N, P, Q, O, M S3: M, N, O, P, Q
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________
In preorder traversal of a binary tree the second step is ____________
In postorder traversal of binary tree right subtree is traversed before visiting root.
Find the postorder traversal of the binary tree shown below.
Which of the following graph traversals closely imitates level order traversal of a binary tree?
What is the speciality about the inorder traversal of a binary search tree?
Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
Which of the following traversal in a binary tree is similar to depth first traversal?
The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be ________