+1 vote
in Data Structures & Algorithms I by (110k points)
The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.

(a) True

(b) False

My question is based upon Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

The question was asked by my school principal while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (b) False

Explanation: Left subtree is traversed first in post-order traversal, then the right subtree is traversed and then the output current node.

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.