Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Construct Binary Tree from Preorder and Inorder · medium trees interview problem · Larpy

medium· trees Mock interview

Construct Binary Tree from Preorder and Inorder

Given `preorder` and `inorder` traversals of a binary tree with unique values, reconstruct and return the tree (its level-order form).

Examples

in: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]

out: [3,9,20,null,null,15,7]

the unique tree

Constraints

1 <= number of nodes <= 3000
values are unique
inorder is a permutation of preorder

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit

More trees problems

Maximum Depth of a Binary Treeeasy
Balanced Binary Treeeasy
Diameter of Binary Treeeasy
Subtree of Another Treeeasy
Count Complete Tree Nodeseasy
Path Sumeasy