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

代码无bug

于 2024-01-22 17:49:39 发布

阅读量346

点赞数 10

分类专栏：数据结构（树）力扣刷题文章标签：算法 leetcode

本文链接：https://blog.csdn.net/aaronyyds/article/details/135754267

版权

力扣刷题同时被 2 个专栏收录

140 篇文章 0 订阅

订阅专栏

数据结构（树）

58 篇文章 0 订阅

订阅专栏

/**
 * 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* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if(postorder.size()==0)return NULL;
        TreeNode* root=new TreeNode(postorder[postorder.size()-1]);
        int k=root->val;
        int idx;
        for(int i=0;i<inorder.size();i++){
            if(inorder[i]==root->val)idx=i;
        }
       vector<int> linorder(inorder.begin(),inorder.begin()+idx);
       vector<int> rinoerder(inorder.begin()+idx+1,inorder.end());
      postorder.pop_back();
       vector<int> lpostorder(postorder.begin(),postorder.begin()+linorder.size());
       vector<int> rpostorder(postorder.begin()+linorder.size(),postorder.end());
       root->left=buildTree(linorder,lpostorder);
       root->right=buildTree(rinoerder,rpostorder);
       return root;
    }
};