Convert Sorted List to Binary Search Tree

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    TreeNode* buildTree(vector<int> &vec,int start,int end){
        if(start>end){
            return NULL;
        }
        int mid=(start+end)/2;
        int val=vec[mid];
        TreeNode *p=  new TreeNode(val);
        p->left=buildTree(vec,start,mid-1);
        p->right=buildTree(vec,mid+1,end);
        return p;
    }
public:
    TreeNode *sortedListToBST(ListNode *head) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> vec;
        ListNode *p=head;
        TreeNode **h=NULL;
        while(p!=NULL){
            vec.push_back(p->val);
            p=p->next;
        }
        return buildTree(vec,0,vec.size()-1);
        
    }
};