Leetcode 105. 从前序与中序遍历序列构造二叉树

最新推荐文章于 2024-07-22 16:27:42 发布

cwtnice

最新推荐文章于 2024-07-22 16:27:42 发布

阅读量78

点赞数

分类专栏：每日一题文章标签： leetcode

本文链接：https://blog.csdn.net/cwtnice/article/details/127110705

版权

每日一题专栏收录该内容

118 篇文章 2 订阅

订阅专栏

原题连接：Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

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.

Example 1:
在这里插入图片描述

Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
Output: [3,9,20,null,null,15,7]

Example 2:

Input: preorder = [-1], inorder = [-1]
Output: [-1]

Constraints:

1 <= preorder.length <= 3000
inorder.length == preorder.length
-3000 <= preorder[i], inorder[i] <= 3000
preorder and inorder consist of unique values.
Each value of inorder also appears in preorder.
preorder is guaranteed to be the preorder traversal of the tree.
inorder is guaranteed to be the inorder traversal of the tree.

方法一：递归

思路：

二叉树是递归定义的，建树的时候自然也能想到递归

C++代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
private:
    // 哈希表<结点值, 下标>
    unordered_map<int, int> index;

public:
    // 建树函数
    TreeNode* myBuildTree(const vector<int>& preorder, const vector<int>& inorder, int preorder_left, int preorder_right, int inorder_left, int inorder_right){

        // 退出的条件
        if (preorder_left > preorder_right) {
            return nullptr;
        }

        // 前序遍历中的第一个节点就是根节点
        int preorder_root = preorder_left;

        // 在中序遍历中定位根节点的下标
        int inorder_root = index[preorder[preorder_root]];

        // 建立根节点
        TreeNode* root = new TreeNode(preorder[preorder_root]);

        // 得到最终树的左子树中的节点数目
        int size_left_subtree = inorder_root - inorder_left;

        // 根结点的左孩子处递归地构造左子树
        // 先序遍历中从左边界+1开始的size_left_subtree个元素对应了中序遍历中从左边界开始到根节点下标-1的元素
        root->left = myBuildTree(preorder, inorder, preorder_left + 1, preorder_left + size_left_subtree, inorder_left, inorder_root - 1);

        // 根结点的右孩子处递归地构造左子树
        // 先序遍历中从左边界+1+左子树节点数目开始到右边界的元素对应了中序遍历中从根节点下标+1到右边界的元素
        root->right = myBuildTree(preorder, inorder, preorder_left + size_left_subtree + 1, preorder_right, inorder_root + 1, inorder_right);

        return root;
    }

    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        int n = preorder.size();
        // 构造哈希映射，帮助我们快速定位根节点
        for (int i = 0; i < n; i++) {
            index[inorder[i]] = i;
        }
        return myBuildTree(preorder, inorder, 0, n - 1, 0, n - 1);
    }
};