/**
* 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:
vector<int>mid;//存中序序列
void getInorder(TreeNode*root)
{
if(root==nullptr) return;//为空直接返回
getInorder(root->left);//递归遍历左子树
mid.push_back(root->val);//节点值存入mid
getInorder(root->right);//递归遍历右子树
}
TreeNode*build(int l,int r)//根据mid构建平衡树
{
int M=(l+r)>>1;//取中间值
TreeNode*tree=new TreeNode(mid[M]);//构建以mid[m]为值的节点
if(l<=M-1) tree->left=build(l,M-1);//递归建立左子树
if(r>=M+1) tree->right=build(M+1,r);//递归建立右子树
return tree;//返回结果
}
TreeNode* balanceBST(TreeNode* root) {
if(root==nullptr) return root;//为空直接返回
getInorder(root);//得到中序序列
return build(0,mid.size()-1);//返回平衡树
}
};
LeetCode:1382. 将二叉搜索树变平衡(C++带详细注释)
最新推荐文章于 2022-10-04 01:51:03 发布