Construct Binary Tree from Preorder and Inorder Traversal

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void buildBST(TreeNode *&root,vector<int> &preorder,int preBegin,int preEnd,vector<int> &inorder,int inBegin,int inEnd)
    {
        if(preBegin>preEnd||inBegin>inEnd)
            return;
        int pRoot=preorder[preBegin];
        root=new TreeNode(pRoot);
        int index=0;
        for(int i=inBegin;i<=inEnd;i++)
        {
            if(inorder[i]==pRoot)
            {
                index=i;
                break;
            }
        }
        int len=index-inBegin;
        buildBST(root->left,preorder,preBegin+1,preBegin+len,inorder,inBegin,index-1);
        buildBST(root->right,preorder,preBegin+len+1,preEnd,inorder,index+1,inEnd);
    }
    TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
        if(preorder.size()==0||inorder.size()==0)
            return NULL;
        TreeNode *root=NULL;
        int preBegin=0,preEnd=preorder.size()-1;
        int inBegin=0,inEnd=inorder.size()-1;
        buildBST(root,preorder,preBegin,preEnd,inorder,inBegin,inEnd);
        return root;
    }
};