输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
限制:
0 <= 节点个数 <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
https://zhuanlan.zhihu.com/p/101951561
# 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:
root=None
if len(preorder) and len(inorder):
num=preorder[0]
root=TreeNode(num)
i=inorder.index(num)
#make sure at least one number
if i>0:
root.left=self.buildTree(preorder[1:i+1],inorder[0:i])
#make sure at least one number
if i<len(inorder)-1:
root.right=self.buildTree(preorder[i+1:],inorder[i+1:])
return root