题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字
python 实现
# 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:
if len(preorder)<=0 or len(inorder)<=0 :return None
curnode = TreeNode(preorder[0])
index = 0
for i in range(len(inorder)):
if inorder[i] == preorder[0]:
index = i
break
curnode.left = self.buildTree(preorder[1:index+1],inorder[:index])
curnode.right = self.buildTree(preorder[index+1:],inorder[index+1:])
return curnode