# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:
# 思路就是前序遍历是根-左-右,中序遍历是左-根-右,从前序遍历得到根节点,从中序遍历得到子树长度,然后递归
if not preorder or not inorder:
return None
root=TreeNode(preorder[0])
i=inorder.index(preorder[0])
root.left=self.buildTree(preorder[1:i+1],inorder[:i])
root.right=self.buildTree(preorder[i+1:],inorder[i+1:])
return root
思路:
- 前序遍历是根-左-右,中序遍历是左-根-右,从前序遍历得到根节点,从中序遍历得到子树长度,然后递归
- 这道题体现了二叉树的基本思想和递归,很好的题目