leetcode 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 {
    
    std::vector<ListNode *> nodevec;
public:

    TreeNode * List2BST(int begin, int end)
    {
        if(begin>end)
        return NULL;
        TreeNode * root = new TreeNode(nodevec[(begin+end)/2]->val);        
        root->left = List2BST(begin, (begin+end)/2-1);
        root->right = List2BST((begin+end)/2+1, end);
        return root;
    }
    
    TreeNode *sortedListToBST(ListNode *head) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        nodevec.clear();        
        if(head==NULL)
        return NULL;
        else if(head->next ==NULL)
        return new TreeNode(head->val);
        
        ListNode * temp=head;
        while(temp!=NULL)
        {
            nodevec.push_back(temp);
            temp=temp->next;            
        }
        
        return List2BST(0, nodevec.size()-1);
    
    }
};