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) {
return dfs(nums, 0, nums.size() - 1);
}
TreeNode* dfs(vector<int>& nums, int start, int end)
{
if (start > end)
return NULL;
if (start == end)
return new TreeNode(nums[start]);
int middle = (start + end) / 2;
TreeNode* root = new TreeNode(nums[middle]);
root->left = dfs(nums, start, middle - 1);
root->right = dfs(nums, middle + 1, end);
return root;
}
};