Convert binary tree traversals to forest count

Q: Convert binary tree traversals to forest count

This is a Software Engineering Fundamentals interview question from Bitkernel for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Software Engineering Fundamentals interview questions?

Software Engineering Fundamentals questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master software engineering fundamentals interviews.

Question

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

Convert binary tree traversals to forest count

Solution

Comments (0)