+1 vote
in Data Structures & Algorithms I by (110k points)
For a binary tree the first node visited in in-order and post-order traversal is same.

(a) True

(b) False

My question is taken from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

This question was addressed to me during an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct option is (b) False

The explanation is: Consider a binary tree,

Its in-order traversal – 13 14 16 19

Its post-order traversal- 14 13 19 16. Here the first node visited is not same.

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.