Construct Binary Tree from Preorder and Inorder 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:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        return buildTree(preorder.begin(), preorder.end(), inorder.begin(), inorder.end());
    }
    
    typedef vector<int>::iterator inIterator;
    TreeNode* buildTree(inIterator prefirst, inIterator prelast, inIterator infirst, inIterator inlast)
    {
        if(prefirst == prelast)
            return nullptr;
        if(infirst == inlast)
            return nullptr;
            
        vector<int>::iterator iter = find(infirst, inlast, *prefirst);
        int dis = distance(infirst, iter);
        
        TreeNode *res = new TreeNode(*prefirst);
        
        res->left = buildTree(prefirst+1, prefirst+dis+1, infirst, iter);
        res->right = buildTree(prefirst+1+dis, prelast, iter+1, inlast);
        
        return res;
    }
};