用最少的代码重建二叉树

---

由前序和中序重建

题目链接

/**
 * 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 {
    typedef vector<int>::iterator vit;
public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        //递归分治
        return recursionBuild(preorder.begin(),preorder.end(),inorder.begin(),inorder.end());
    }

    //递归分治
    TreeNode* recursionBuild(vit preBegin, vit preEnd,vit inBegin, vit inEnd)
    {
        if(inEnd==inBegin) return NULL;
        TreeNode* cur = new TreeNode(*preBegin);
        auto root = find(inBegin,inEnd,*preBegin);
        cur->left = recursionBuild(preBegin+1,preBegin+1+(root-inBegin),inBegin,root);
        cur->right = recursionBuild(preBegin+1+(root-inBegin),preEnd,root+1,inEnd);
        return cur;
    }
};

---

由中序和后序重建

题目链接

/**
 * 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 {
    typedef vector<int>::iterator it;
    TreeNode* rebuild(it inbegin,it inend,it postbegin,it postend){
        if(inbegin==inend) return nullptr;
        TreeNode* cur=new TreeNode(*(postend-1));
        auto root=find(inbegin,inend,*(postend-1));
        cur->left=rebuild(inbegin,root,postbegin,postbegin+(root-inbegin));
        cur->right=rebuild(root+1,inend,postbegin+(root-inbegin),(postend-1));
        return cur;
    }
public:
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        return rebuild(inorder.begin(),inorder.end(),postorder.begin(),postorder.end());
    }
};