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?
(a) L N M O Q P T
(b) N M O P O L T
(c) L M N O P Q T
(d) O P L M N Q T
My question comes from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I
The question was asked during an internship interview.