Construct Binary Tree from Inorder and Postorder Traversal

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

xuxumoi

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

阅读量237

点赞数

分类专栏： LeetCode 文章标签： LeetCode Tree DepthFirstSearch traversal Array

本文链接：https://blog.csdn.net/xsloop/article/details/46848909

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* CreateCore(vector<int>& inorder, vector<int>& postorder, int istart, int iend, int pstart, int pend)
    {
        if(istart == iend)
            return new TreeNode(inorder[istart]);
        if(istart - iend != pstart - pend)
            return NULL;
        if(istart > iend || pstart > pend)
            return NULL;
        
        TreeNode* root = new TreeNode(postorder[pend]);
        
        vector<int>::iterator iter = find(inorder.begin(), inorder.end(), postorder[pend]);
        int pos = iter - inorder.begin();
        root->left = CreateCore(inorder, postorder, istart, pos-1, pstart, pstart + pos-1 - istart);
        root->right = CreateCore(inorder, postorder, pos+1, iend, pstart+pos-istart, pend-1);
        
        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if(inorder.size() == 0 || inorder.size()!=postorder.size())
            return NULL;
        
        TreeNode* root = CreateCore(inorder, postorder, 0, inorder.size()-1, 0, postorder.size()-1);

        return root;
    }
};