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

题目：https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

/**
 * 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:
    int Search(int val,int &l,int &r) {
        for(int i = l;i right,id+1,r);
        dfs(root->left,l,id-1);
    }
    TreeNode* buildTree(vector& inorder, vector& postorder) {
        this->postorder = postorder;
        this->inorder = inorder;
        n = inorder.size();
        if(!n) return nullptr;
        pos = n-1;
        TreeNode *root;
        dfs(root,0,n-1);
        return root;
    }
private:
    vector postorder;
    vector inorder;
    int pos,n;
};