Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
/**
* 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* execute(vector<int> &num, int start, int end)
{
if (start > end) return 0;
TreeNode* node = new TreeNode(num[(end + start + 1)/2]);
node->left = execute(num, start, (end + start + 1)/2 - 1);
node->right = execute(num, (end + start + 1)/2 + 1, end);
return node;
}
TreeNode *sortedArrayToBST(vector<int> &num)
{
return execute(num, 0, num.size()-1);
}
};