[LeetCode]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 {
    typedef vector<int>::iterator Ite;
public:
    TreeNode *buildTree(Ite x, Ite y, Ite a, Ite b)
    {
        if (x >= y) return NULL;
        if (y - x == 1) return new TreeNode(*x);
        int rv = *(--b);
        int i; // find root offset i
        for (i = 0; x + i < y; i++) if (*(x + i) == rv) break;
        TreeNode *root = new TreeNode(rv);
        root->left = buildTree(x, x + i, a, a + i);
        root->right = buildTree(x + i + 1, y, a + i, b);
        return root;
    }
    
    TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
        return buildTree(inorder.begin(), inorder.end(), postorder.begin(), postorder.end());
    }
};