+1 vote
in Data Structures & Algorithms I by (110k points)
The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is ______

(a) 3

(b) 1

(c) 2

(d) any number

This key question is from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

The question was asked in an online quiz.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (b) 1

For explanation: The tree with only one node has post-order and pre-order traversals equal.

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.