leetcode 105.从前序与中序遍历序列构造二叉树(python)

leetcode 105.从前序与中序遍历序列构造二叉树(python)

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

注意:
你可以假设树中没有重复的元素。

例如，给出

前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]

返回如下的二叉树：

    3
   / \
  9  20
    /  \
   15   7

递归

# 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 or not inorder:
            return None
        def recurr(inorder):
            x = preorder.pop(0)
            node = TreeNode(x)
            idx = inorder.index(x)
            left_order = inorder[:idx]
            right_order = inorder[idx+1:]
            node.left = recurr(left_order) if left_order else None
            node.right = recurr(right_order) if right_order else None
            return node
        return recurr(inorder)