Description:
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
分析:这道题是让我们将一个排序好的数组转化为一个高度均衡的BST(Binary Search Tree),所谓的高度均衡就是每个节点的左右子树深度差距不超过1(这里最开始我的理解有误 可参见下一道leetcode 这道题并无影响)。首先,我们需要知道什么是一个BST,参见我的其他博文有记录。下面是思路,因为右子树永远大于左子树,那么他们的父节点肯定是sorted Array的中间值,如此递归不断调用即可。一个小细节在求中间数的时候 mid = (low + high)/ 2时,我们为了首先满足左子树(和题目例子一样 当然 满足右子树也是可以的),我们可以改为(low+high+1)/2。
代码:
/**
* 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 sortedArrayToBST(nums, 0, nums.size() - 1);
}
TreeNode* sortedArrayToBST(vector<int>& nums, int head, int tail)
{
if(head > tail)
return nullptr;
int mid = (head + tail + 1) / 2;
TreeNode* root = new TreeNode(nums[mid]);
root->left = sortedArrayToBST(nums, head, mid - 1);
root->right = sortedArrayToBST(nums, mid + 1, tail);
return root;
}
};
【你必须非常努力 才能看起来毫不费力】