[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal

题目内容

根据一棵树的前序遍历与中序遍历构造二叉树。

https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:You may assume that duplicates do not exist in the tree.

For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

---

题目思路

这道题目是在考察对于前序和中序的遍历方式。通过寻找两种遍历序列中，根节点的位置来确定左右子树前序和中序list的范围，然后不断递归求解。

---

程序代码

# 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 not preorder and not inorder:
            return
        root=TreeNode(preorder[0])
        site=inorder.index(root.val)
        left_pre,right_pre=preorder[1:site+1],preorder[site+1:]
        left_in,right_in=inorder[:site],inorder[site+1:]
        root.left=self.buildTree(left_pre,left_in)
        root.right=self.buildTree(right_pre,right_in)
        return root