题目:根据一棵树的前序遍历与中序遍历构造二叉树。无重复元素
思路:
- 分治/递归:前序第一个元素为头结点,在中序中找到左子树和右子树的位置,分别构造,使用dict记录中序位置映射可优化,不需要每次从头查(无重复时)
- 迭代:利用栈,前序第一个元素为头结点,先找到最深的左节点,依次入栈,然后构造右子树
代码:
# 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
head = TreeNode(preorder[0])
for i in range(len(inorder)):
if inorder[i] == head.val:
head.left = self.buildTree(preorder[1:i+1], inorder[0:i])
head.right = self.buildTree(preorder[i+1:len(preorder)], inorder[i+1:len(inorder)])
break
return head