原文地址:http://blog.csdn.net/magisu/article/details/15025037
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* BST(int left,int right,vector<int> nums)
{
if(left>right)
return NULL;
else if(left==right)
return new TreeNode(nums[left]);
else
{
int mid=(left+right)/2;
TreeNode* root=new TreeNode(nums[mid]);
root->left=BST(left,mid-1,nums);
root->right=BST(mid+1,right,nums);
return root;
}
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
return BST(0,nums.size()-1,nums);
}
};