Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2024-07-05 21:55:11 发布

小白菜又菜

最新推荐文章于 2024-07-05 21:55:11 发布

阅读量255

点赞数

分类专栏：解题报告 Leetcode

本文链接：https://blog.csdn.net/mobius_strip/article/details/117301142

版权

解题报告同时被 2 个专栏收录

1369 篇文章 4 订阅

订阅专栏

Leetcode

150 篇文章 0 订阅

订阅专栏

该博客主要介绍了如何通过前序遍历（preorder）和中序遍历（inorder）的数组来构建二叉树。算法采用深度优先搜索（DFS）策略，首先在中序遍历中找到根节点，然后递归地构造左子树和右子树。提供的代码实现了一个名为`Solution`的类，包含一个`buildTree`方法，该方法接收前序和中序遍历的数组，并返回构建好的二叉树节点。

摘要由CSDN通过智能技术生成

Problem

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

Algorithm

Recursion. Just use dfs, find the root in the inorder traversal then divided the trees into left sub-trees, roots and right sub-trees and run in recursion.

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        Lp = len(preorder)
        Li = len(inorder)
        if Lp != Li:
            return []
        
        def dfs(pL, pR, iL, iR):
            if pL > pR:
                return None
            L, R = None, None
            for r in range(iL, iR+1):
                if inorder[r] == preorder[pL]:
                    L = dfs(pL+1, pL+r-iL, iL, r-1)
                    R = dfs(pL+r-iL+1, pR, r+1, iR)
                    break
            return TreeNode(preorder[pL], L, R)
        
        return dfs(0, Lp-1, 0, Li-1)