+1 vote
in Data Structures & Algorithms I by (110k points)
In postorder traversal of binary tree right subtree is traversed before visiting root.

(a) True

(b) False

My question comes from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

I had been asked this question in unit test.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (a) True

Easiest explanation - Post-order method of traversing involves  – i) Traverse left subtree in post-order, ii) Traverse right subtree in post-order, iii) visit the root.

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.