For A Binary Tree The First Node Visited In In-order And Post-order Traversal Is Same.

› Category: Questions › For a binary tree the first node visited in in-order and post-order traversal is same.

Editor Staff asked 5 months ago

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.

Question Tags: Interview-Questions-Answers

1 Answers

0 Vote Up Vote Down

Editor">

Editor Staff answered 5 months ago

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 Posts

Most commonly asked OpenAI interview questions and answers

Common AI interview questions and answers:

How do you uninstall gulp?