力扣-剑指 Offer 07. 重建二叉树

题目描述：

  输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

例如，给出

前序遍历 preorder = [3,9,20,15,7]

中序遍历 inorder = [9,3,15,20,7]

返回如下的二叉树：

    3
   / \
  9  20
    /  \
   15   7

限制：

$0<=节点个数<=5000$

解题思路

参考: LeetCode力扣刷题 | 剑指Offer题解 | 画解算法思路Python3或C++代码实现_哔哩哔哩_bilibili https://www.bilibili.com/video/BV1CK411c7gx?p=5.

python3代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        index={val: i for i ,val in enumerate(inorder)}
        def build(preRootId,inL,inR):
            if inL>inR:
                return None
            rootVal = preorder[preRootId]
            inRootId=index[rootVal]
            leftSize=inRootId-inL
            root=TreeNode(rootVal)
            root.left=build(preRootId+1,inL,inRootId-1)
            root.right=build(preRootId+1+leftSize,inRootId+1,inR)
            return root
        return build(0,0,len(inorder)-1)