leetcode_question_108 Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

Recursive:

/**
 * 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 *tobst(vector<int> num, int begin, int end)
    {
		if(begin > end) return NULL;
		if(begin == end)
			return new TreeNode(num[begin]);
		int mid = begin + (end - begin)/2;
		TreeNode* tmp = new TreeNode(num[mid]);
		tmp->left = tobst(num, begin, mid-1);
		tmp->right = tobst(num, mid+1, end);
		return tmp;
	}
	TreeNode *sortedArrayToBST(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return tobst(num, 0, num.size()-1);
    }
};