Convert binary tree traversals to forest count
Company: Bitkernel
Role: Software Engineer
Category: Software Engineering Fundamentals
Difficulty: medium
Interview Round: Online Assessment
A binary tree has the following traversals:
- Inorder: `A, B, C, D, E, F, G`
- Postorder: `B, D, C, A, F, G, E`
This binary tree is converted to an equivalent forest using the standard left-child/right-sibling representation (left child = first child, right child = next sibling).
How many trees does the resulting forest contain?
Options:
- A. `1`
- B. `2`
- C. `3`
- D. `4`
Quick Answer: This question evaluates understanding of binary tree traversals and the left-child/right-sibling (first-child/next-sibling) representation, testing the ability to infer hierarchical relationships from given inorder and postorder sequences.