剑指 Offer 07. 重建二叉树

时间复杂度O（nlogn)，可以有重复元素的解法：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
    	if len(preorder)==0 or len(inorder)==0:return
    	root=TreeNode(preorder[0])
    	idx=inorder.index(preorder[0])#list.index()返回第一个符合要求的值的index
    	root.left=self.buildTree(preorder[1:idx+1],inorder[0:idx])
    	root.right=self.buildTree(preorder[idx+1:],inorder[idx+1:])
    	return root

时间复杂度为O(n)的解法，只适用于没有重复元素：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
    	dic={}
    	for index,val in enumerate(inorder):
    		dic[val]=index 
    	def helper(preorder_left,preorder_right,inorder_left,inorder_right):
    		if preorder_left>preorder_right:return
    		root=TreeNode(preorder[preorder_left])
    		root_inorder=dic[preorder[preorder_left]]
    		left_size=root_inorder-inorder_left
    		root.left=helper(preorder_left+1,preorder_left+left_size,inorder_left,root_inorder-1)
			root.right=helper(preorder_left+left_size+1,preorder_right,root_inorder+1,inorder_right)
			return root
		return helper(0,len(preorder)-1,0,len(inorder)-1)