[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder traversal of a tree, construct the binary 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 *generate(vector<int> &postorder,vector<int> &inorder, int pl,int pr,int il,int ir){
        TreeNode *root;
        if(pl > pr || il > ir)
            root = NULL;
        else{
            root = new TreeNode(postorder[pr]);
            int i;
            for(i = il;i <= ir && inorder[i] != postorder[pr];i ++);
            root -> left = generate(postorder,inorder,pl,pl + i - il - 1,il,i - 1);
            root -> right = generate(postorder,inorder,pl + i - il,pr - 1,i + 1,ir);
        }
        return root;
    }
     TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
        return generate(postorder,inorder,0,postorder.size() - 1,0,inorder.size() - 1);
    }
};