construct-binary-tree-from-inorder-and-postorder-traversal 根据中序和后序重建二叉树

题目描述

Given inorder and postorder traversal of a tree, construct the binary tree.

Note: 
You may assume that duplicates do not exist in the tree.

/**
 * 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 *buildTree(vector<int> &inorder, vector<int> &postorder) {
        int size = inorder.size();
        if(!size) return nullptr;
        vector<int> left_inorder; vector<int> left_postorder;
        vector<int> right_inorder; vector<int> right_postorder;
        int mid = postorder.back(); postorder.pop_back();
        int i = 0;
        TreeNode* root = new TreeNode(mid);
        
        for(;inorder[i] != mid;++i)
            left_inorder.push_back(inorder[i]);
        for(++i;i < size;++i)
            right_inorder.push_back(inorder[i]);
        int left_size = left_inorder.size();
        for(i = 0;i < left_size;++i)
            left_postorder.push_back(postorder[i]);
        --size;
        for(;i < size;++i)
            right_postorder.push_back(postorder[i]);
        
        root->left = buildTree(left_inorder,left_postorder);
        root->right = buildTree(right_inorder,right_postorder);
        return root;
    }
};