https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
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 convert(nums, 0, nums.size()-1);
}
TreeNode* convert(vector<int>& nums, int st, int ed) {
if(st == ed) return new TreeNode(nums[st]);
if(st > ed) return NULL;
int rtIdx = (st+ed)>>1;
TreeNode *root = new TreeNode(nums[rtIdx]);
root->left = convert(nums, st, rtIdx-1);
root->right = convert(nums, rtIdx+1, ed);
return root;
}
};