In post-order traversal, the root is the last element visited. Here, the last element in the traversal is B, making it the root.
Thus, the root of the tree is \( B \).
Was this answer helpful?
0
0
Top AP PGECET Computer Science & Information Technology Questions