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