Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
if(nums.size()==0) return NULL;
TreeNode* root = sortedArrayToBST(nums,0,nums.size()-1);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums,int begin,int end){
if(begin>end) return NULL;
int mid = (begin+end+1)/2;
TreeNode* root = new TreeNode(nums[mid]);
root->left = sortedArrayToBST(nums,begin,mid-1);
root->right = sortedArrayToBST(nums,mid+1,end);
return root;
}
};