Question: Given the following two traversals of a binary tree: INORDER: 1 2 3 4 5 6 7 8 9 10 PREORDER: 6 2 1 4
Given the following two traversals of a binary tree: INORDER: 1 2 3 4 5 6 7 8 9 10 PREORDER: 6 2 1 4 3 5 10 8 7 9, reconstruct the tree. (Hint: In a pre- or post-order traversal, where does the root end up? Think recursively.)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
