106. 从中序与后序遍历序列构造二叉树

最新推荐文章于 2022-04-08 16:03:50 发布

Stdleohao

最新推荐文章于 2022-04-08 16:03:50 发布

阅读量82

点赞数

分类专栏： leetcode 文章标签：算法数据结构

本文链接：https://blog.csdn.net/stdleohao/article/details/119907765

版权

leetcode 专栏收录该内容

71 篇文章 0 订阅

订阅专栏

该博客介绍了如何使用C++实现从给定的中序和后序遍历结果来重建二叉树。算法通过找到后序遍历中的最后一个元素作为根节点，然后递归地分割中序和后序遍历数组来构建左右子树。这种方法利用了后序遍历的特点，避免了创建新的数组，直接在原数组上操作。

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

题目链接

/**
 * 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 {
public:
    TreeNode* travel(vector<int>& inorder, int inorderBegin, int inorderEnd, vector<int>& postorder, int postorderBegin, int postorderEnd) {
        if (postorderBegin == postorderEnd) return nullptr;

        int rootValue = postorder[postorderEnd-1];
        TreeNode* root = new TreeNode(rootValue);
        if (postorderEnd - postorderBegin == 1) {
            return root;
        }
        
        int inNodeIndex;
        for (int i = inorderBegin; i < inorderEnd; i++) {
            if (inorder[i] == rootValue) {
                inNodeIndex = i;
                break;
            }
        }

        // [0,inNodeIndex) [inNodeIndex+1, inSize)
        int leftInorderBegin = inorderBegin;
        int leftInorderEnd = inNodeIndex;
        int rightInorderBegin = inNodeIndex + 1;
        int rightInorderEnd = inorderEnd;
        // [0,inNodeIndex) [inNodeIndex, postSize-1)
        int leftPostorderBegin = postorderBegin;
        int leftPostorderEnd = postorderBegin + (inNodeIndex-leftInorderBegin);
        int rightPostorderBegin = postorderBegin + (inNodeIndex-leftInorderBegin);
        int rightPostorderEnd = postorderEnd - 1;

        root->left = travel(inorder, leftInorderBegin, leftInorderEnd, 
                                postorder, leftPostorderBegin, leftPostorderEnd);

        root->right = travel(inorder, rightInorderBegin, rightInorderEnd, 
                                postorder, rightPostorderBegin, rightPostorderEnd);

        return root;
    }

    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        int inSize = inorder.size();
        int postSize = postorder.size();
        if (inSize == 0 || postSize == 0)
            return nullptr;
        
        return travel(inorder, 0, inSize, postorder, 0, postSize);
    }
};