题目描述
方法:
前序遍历:根左右
中序遍历:左根右
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
# root表示在pre中的序号,left,right表示在in中序号
class Solution:
def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
def recur(root, left, right):
if left > right:
return
rootnode = TreeNode(preorder[root])
inorder_root = in_index[preorder[root]]
rootnode.left = recur(root+1, left, inorder_root-1)
rootnode.right = recur(root+inorder_root-left+1, inorder_root+1,right)
return rootnode
in_index = {}
for i, node in enumerate(inorder):
in_index[node] = i
return recur(0, 0, len(inorder) - 1)