Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

Problem

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.

Algorithm

Recursion. Just use dfs, find the root in the inorder traversal then divided the trees into left sub-trees, roots and right sub-trees and run in recursion.

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        Lp = len(preorder)
        Li = len(inorder)
        if Lp != Li:
            return []
        
        def dfs(pL, pR, iL, iR):
            if pL > pR:
                return None
            L, R = None, None
            for r in range(iL, iR+1):
                if inorder[r] == preorder[pL]:
                    L = dfs(pL+1, pL+r-iL, iL, r-1)
                    R = dfs(pL+r-iL+1, pR, r+1, iR)
                    break
            return TreeNode(preorder[pL], L, R)
        
        return dfs(0, Lp-1, 0, Li-1)

The title cannot longer than 30?