What is the post-order traversal of a binary tree with nodes A, B, C?
Practice Questions
1 question
Q1
What is the post-order traversal of a binary tree with nodes A, B, C?
A, B, C
B, C, A
C, B, A
A, C, B
In post-order traversal, the left subtree is visited first, then the right subtree, and finally the root. For a tree with nodes A (root), B (left), and C (right), the traversal is B, C, A.
Questions & Step-by-step Solutions
1 item
Q
Q: What is the post-order traversal of a binary tree with nodes A, B, C?
Solution: In post-order traversal, the left subtree is visited first, then the right subtree, and finally the root. For a tree with nodes A (root), B (left), and C (right), the traversal is B, C, A.
