AcWing 18. 重建二叉树
原题链接
中等
作者:
废wù
,
2021-02-01 22:27:21
,
所有人可见
,
阅读 319
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def buildTree(self, preorder, inorder):
"""
:type preorder: List[int]
:type inorder: List[int]
:rtype: TreeNode
"""
if len(preorder)==0:
return None
root=TreeNode(preorder[0])
root_index=inorder.index(preorder[0])
root.left=self.buildTree(preorder[1:root_index+1],inorder[:root_index])
root.right=self.buildTree(preorder[root_index+1:],inorder[root_index+1:])
return root