>ExpInterview_

Construct Binary Tree From Preorder And Inorder Traversal

Medium
TreeDFS

Construct Binary Tree from Preorder and Inorder Traversal

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]

Examples

Input: inorder = [9,3,15,20,7], preorder = [3,9,20,15,7]
Output: [3,9,20,null,null,15,7]
Input: inorder = [-1], preorder = [-1]
Output: [-1]
Input: inorder = [2,1], preorder = [1,2]
Output: [1,2]

Constraints

  • •1 <= preorder.length <= 3000
  • •inorder.length == preorder.length
  • •-3000 <= preorder[i], inorder[i] <= 3000
  • •preorder and inorder consist of unique values.
  • •Each value of inorder also appears in preorder.
  • •preorder is guaranteed to be the preorder traversal of the tree.
  • •inorder is guaranteed to be the inorder traversal of the tree.