1 问题
给定两个整数数组 preorder 和 inorder ,其中 preorder 是二叉树的先序遍历, inorder 是同一棵树的中序遍历,请构造二叉树并返回其根节点。
示例 1:
输入: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
输出: [3,9,20,null,null,15,7]
示例 2:
输入: preorder = [-1], inorder = [-1]
输出: [-1]
2 答案
时间复杂度:O(n2) ,空间复杂度:O(n2)
class Solution:
def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:
if not preorder:
return
left_size = inorder.index(preorder[0])
left = self.buildTree(preorder[1: 1+left_size], inorder[:left_size])
right = self.buildTree(preorder[1+left_size:], inorder[left_size+1:])
return TreeNode(preorder[0], left, right)
时间复杂度:O(n) ,空间复杂度:O(n)
class Solution:
def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:
index = {x: i for i, x in enumerate(inorder)}
def dfs(pre_l, pre_r, in_l, in_r):
if pre_l == pre_r:
return None
left_size = index[preorder[pre_l]] - in_l
left = dfs(pre_l + 1, pre_l + 1 + left_size, in_l, in_l + left_size)
right = dfs(pre_l + 1 + left_size, pre_r, in_l + left_size + 1, in_r)
return TreeNode(preorder[pre_l], left, right)
return dfs(0, len(preorder), 0, len(inorder))
https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/solutions/2646359/tu-jie-cong-on2-dao-onpythonjavacgojsrus-aob8