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 binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
TreeNode *sortedArrayToBST(vector<int> &num, int l, int r) {
if (l < r) {
int mid = l + ((r-l)>>1);
TreeNode *head = new TreeNode(num[mid]);
head->left = sortedArrayToBST(num, l, mid);
head->right = sortedArrayToBST(num, mid+1, r);
return head;
} else
return NULL;
}
public:
TreeNode *sortedArrayToBST(vector<int> &num) {
return sortedArrayToBST(num, 0, num.size());
}
};