Reconstruct Binary Tree Traversals

MediumPython

Problem

Given two integer arrays preorder and inorder representing the preorder and inorder traversals of the same binary tree, reconstruct the binary tree and return its root. Assume all node values are unique, and the traversals are valid.

Constraints

1 <= preorder.length <= 3000
preorder.length == inorder.length
-3000 <= preorder[i], inorder[i] <= 3000
All values in preorder and inorder are unique
The given traversals describe a valid binary tree

Function Signature

def build_tree(preorder, inorder):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.