Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Example:
Given the sorted array: [-10,-3,0,5,9],
One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:
0
/ \
-3 9
/ /
-10 5
注意看清题意,只要二叉平衡搜索树即可,不是一定要和例子中的树一模一样。
/**
* 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* func(int left,int right,vector<int> &nums){
if(left>right){
return NULL;
}
int mid=(left+right)/2;
TreeNode* T=new TreeNode(nums[mid]);
T->left=func(left,mid-1,nums);
T->right=func(mid+1,right,nums);
return T;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
return func(0,nums.size()-1,nums);
}
};