+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following pair’s traversals on a binary tree can build the tree uniquely?

(a) post-order and pre-order

(b) post-order and in-order

(c) post-order and level order

(d) level order and preorder

The query is from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

The question was asked in class test.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right answer is (b) post-order and in-order

Best explanation: A binary tree can uniquely be created by post-order and in-order traversals.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.