Question: What is the result of a post-order traversal on a binary tree with nodes 1, 2, and 3, where 1 is the root, 2 is the left child, and 3 is the right child?
Options:
Correct Answer: 2, 3, 1
Solution:
In post-order traversal, we visit the left child, then the right child, and finally the parent. Thus, the output is 2, 3, 1.