输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
# 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:
return self.helper(preorder, inorder)
def helper(self, preorder, inorder):
if not preorder: # 递归结束
return None
cur_root_val = preorder[0] # 当前的根节点值
index = 0
for i in range(len(inorder)): # 在中序遍历中找到其索引
if inorder[i] == cur_root_val:
index = i
root = TreeNode(cur_root_val) # 构建当前的根节点
root.left = self.buildTree(preorder[1:index+1], inorder[0:index]) # 左右节点
root.right = self.buildTree(preorder[1+index:], inorder[index+1:])
return root