Problem · Array
Construct a Tree from Level-Order and Inorder Traversals
● Hard
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Given the levelOrder and inorder traversals of the same binary tree, reconstruct and return its root.
The problem statement continues
ProExamples
Example 1
levelOrder = [3,9,20,15,7]inorder = [9,3,15,20,7]return = [3,9,20,null,null,15,7]The root 3 appears first in level order; the inorder split places 9 left and the remaining nodes right.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week