leetcode 面试题07 重建二叉树

解题思路：(1)递归构造二叉树，构建根节点，根据中序遍历找到左子树的节点和右子树的结点，构建左子树，构建右子树

# 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(inorder) == 0:
            return None
        root = TreeNode(preorder[0])
        i = inorder.index(root.val)
        left = self.buildTree(preorder[1:i+1], inorder[:i])
        right = self.buildTree(preorder[i+1:],inorder[i+1:])
        root.left = left
        root.right = right
        return root

解题思路：（2）迭代，用栈来模拟递归，整个出栈入栈的过程就是中序遍历的过程，只是访问的过程就是栈顶元素和当前中序遍历中元素相等时候

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        if len(preorder) == 0:
            return None
        
        prei, inoi = 1, 0
        root = TreeNode(preorder[0])
        s = [root]
        while(len(s)):
            while(prei < len(preorder) and s[-1].val != inorder[inoi]):
                s[-1].left = TreeNode(preorder[prei])
                s.append(s[-1].left)
                prei += 1
            while(len(s) and s[-1].val == inorder[inoi]):
                cur = s.pop()
                inoi += 1
            if (prei < len(preorder)):
                cur.right = TreeNode(preorder[prei])
                s.append(cur.right)
                prei += 1
        return root

欢迎大家在评论区讨论和交流哦~