LeetCode - Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

/**
 * 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 {
public:

     TreeNode* sortedArrayToBST(vector<int> &num,int begin,int end){
    	if(begin>end){
			return NULL;
	    }
        int mid=begin+(end-begin)/2;
	    TreeNode* node=new TreeNode(num[mid]);
	    node->left=sortedArrayToBST(num,begin,mid-1);
        node->right=sortedArrayToBST(num,mid+1,end); 
		return node;
    }
	
    TreeNode *sortedArrayToBST(vector<int> &num) {
		if(num.empty()){
			return NULL;
		} 
	     return sortedArrayToBST(num,0,num.size()-1);
    }

	TreeNode *sortedListToBST(ListNode *head) {
		if(head==NULL){
			return NULL;
		}
        vector<int> num;
		ListNode* p=head;
		while(p!=NULL){
			num.push_back(p->val);
			p=p->next;
		}
		return sortedArrayToBST(num);
    }
};