Construct Binary Tree from Preorder and Inorder
Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

30:00

Construct Binary Tree from Preorder and Inorder
medium
Topics
Companies

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

Example 1:
Input: {"preorder":[3,9,20,15,7],"inorder":[9,3,15,20,7]}
Output: [3,9,20,null,null,15,7]
Constraints:

  • 1≤preorder.length≤30001 \leq \text{preorder.length} \leq 3000

  • inorder.length==preorder.length\text{inorder.length} == \text{preorder.length}

  • −3000≤preorder[i],inorder[i]≤3000-3000 \leq \text{preorder}[i], \text{inorder}[i] \leq 3000

  • preorder and inorder consist of unique values.

  • Each value of inorder also appears in preorder and vice versa.

  • preorder is guaranteed to be the preorder traversal and inorder is the inorder traversal.

Input
arr ={"preorder":[3,9,20,15,7],"inorder":[9,3,15,20,7]}

Start building

Variables
No variables to display
DepthFunction Call
Stack empty
0/36