给定两个整数数组 preorder 和 inorder ,其中 preorder 是二叉树的先序遍历, inorder 是同一棵树的中序遍历,请构造二叉树并返回其根节点。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
例:
输入: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
输出: [3,9,20,null,null,15,7]
解析:
使用递归调用,每次递归存储当前子树的根节点。先序遍历的第一个即为根节点。将先序遍历的第一个节点在中序遍历中找出,在中序遍历中此节点的左边为左子树,右边为右子树。记录左子树的长度L_left,先序遍历中第一个节点(也就是根节点)向后L_left长度即为左子树,然后剩余的为右子树。
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def buildTree(self, preorder, inorder):
"""
:type preorder: List[int]
:type inorder: List[int]
:rtype: TreeNode
"""
def build(pre_left, pre_right, mid_left, mid_right): # 递归函数
if pre_left > pre_right or mid_left > mid_right: # 终止条件
return None
root = TreeNode(preorder[pre_left]) # 存储根节点
mid_root = mid_left
while mid_root <= mid_right and inorder[mid_root] != preorder[pre_left]:
mid_root += 1 # 寻找中序遍历中的根节点
diff = mid_root - mid_left # 左子树长度
root.left = build(pre_left + 1, pre_left + diff, mid_left, mid_root - 1) #左子树
root.right = build(pre_left + 1 + diff, pre_right, mid_root + 1, mid_right) # 右子树
return root # 返回根节点
return build(0, len(preorder) - 1, 0, len(inorder) - 1)