Let $T$ be a rooted binary tree whose vertices are labelled with symbols $a, b, c, d, e, f, g, h, i, j, k$. Suppose the in-order (visit left subtree, visit root, visit right subtree) and post-order (visit left subtree, visit right subtree, visit root) traversals of $T$ produce the following sequences.
in-order:$a, b, c, d, e, f, g, h, i, j, k$
post-order:$a, c, b, e, f, h, j, k, i, g, d$
How many leaves does the tree have?
- THREE.
- FOUR.
- FIVE.
- SIX.
- Cannot be determined uniquely from the given information.