Construct Binary Tree from Inorder and Postorder Traversal

最新推荐文章于 2021-02-03 15:56:42 发布

wishingweed

最新推荐文章于 2021-02-03 15:56:42 发布

阅读量403

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010484308/article/details/42882563

版权

leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode *build(vector<int> &inorder, vector<int> &postorder, int il, int ir, int pl, int pr)
    {
        if(il > ir || pl > pr)
            return NULL;
        TreeNode *root = new TreeNode(postorder[pr])
        int i = il
        for(;i< ir;i++)
        {
            if(inorder[i]==postorder[pr])
                break;
        }
        root->left = build(inorder,postorder,il,i-1,pl,pl+i-il-1);
        root->right = build(inorder,postorder,i+1,ir,pl+i-il,pr-1);
    }
    TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
        return build(inorder, postorder, 0, inorder.size() - 1, 0, postorder.size() - 1);
    }
};