给你一个整数数组 nums ,其中元素已经按 升序 排列,请你将其转换为一棵 高度平衡 二叉搜索树。
高度平衡 二叉树是一棵满足「每个节点的左右两个子树的高度差的绝对值不超过 1 」的二叉树。
示例 1:
输入:nums = [-10,-3,0,5,9]
输出:[0,-3,9,-10,null,5]
解释:[0,-10,5,null,-3,null,9] 也将被视为正确答案:
示例 2:
输入:nums = [1,3]
输出:[3,1]
解释:[1,null,3] 和 [3,1] 都是高度平衡二叉搜索树。
提示:
-
1 <= nums.length <= 104
-
-104 <= nums[i] <= 104
-
nums 按 严格递增 顺序排列
递归法:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
private:
TreeNode* traversal(vector<int>& nums,int left,int right){
if(left>right)return nullptr;
int mid=left+((right-left)/2);
TreeNode* root=new TreeNode(nums[mid]);
root->left=traversal(nums,left,mid-1);
root->right=traversal(nums,mid+1,right);
return root;
}
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root=traversal(nums,0,nums.size()-1);
return root;
}
};
迭代法:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
if(nums.size()==0)return nullptr;
TreeNode* root=new TreeNode(0);
queue<TreeNode*>nodeQue;
queue<int>rightQue;
queue<int>leftQue;
nodeQue.push(root);
rightQue.push(nums.size()-1);
leftQue.push(0);
while(!nodeQue.empty()){
TreeNode* curNode=nodeQue.front();nodeQue.pop();
int left=leftQue.front();leftQue.pop();
int right=rightQue.front();rightQue.pop();
int mid=left+((right-left)/2);
curNode->val=nums[mid];
if(left<=mid-1){
curNode->left=new TreeNode(0);
nodeQue.push(curNode->left);
leftQue.push(left);
rightQue.push(mid-1);
}
if(right>=mid+1){
curNode->right=new TreeNode(0);
nodeQue.push(curNode->right);
leftQue.push(mid+1);
rightQue.push(right);
}
}
return root;
}
};