1382. Balance a Binary Search Tree（C语言）将一个普通的二叉搜索树变成平衡二叉搜索树

最新推荐文章于 2022-11-23 04:13:46 发布

晴宝儿

最新推荐文章于 2022-11-23 04:13:46 发布

阅读量442

点赞数

CC 4.0 BY-SA版权

分类专栏：二叉树文章标签： c语言算法 leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_42413356/article/details/127806114

二叉树专栏收录该内容

21 篇文章

订阅专栏

该博客介绍了如何使用C语言将给定的普通二叉搜索树转换为平衡二叉搜索树，通过先构建递增数组再构造新树的方法。通过示例和代码展示了解决思路和步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1382. Balance a Binary Search Tree（C语言）

将一个普通的二叉搜索树变成平衡二叉搜索树

题目

Given the root of a binary search tree, return a balanced binary search tree with the same node values. If there is more than one answer, return any of them.

A binary search tree is balanced if the depth of the two subtrees of every node never differs by more than 1.

Example 1:
在这里插入图片描述
Input: root = [1,null,2,null,3,null,4,null,null]
Output: [2,1,3,null,null,null,4]
Explanation: This is not the only correct answer, [3,1,4,null,2] is also correct.

Example 2:
在这里插入图片描述
Input: root = [2,1,3]
Output: [2,1,3]

Constraints:
The number of nodes in the tree is in the range [1, 104].
1 <= Node.val <= 105

解答

思路：先将原树转化为递增数组，再构建新的平衡二叉搜索树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
 //先将原树转化为递增数组，再构建新的平衡二叉搜索树
int array_len;
void Tra_build_array(struct TreeNode * root, int * array)
{
    if(root == NULL)
        return ;
    
    Tra_build_array(root->left, array);
    array[array_len] = root->val;
    array_len ++;
    Tra_build_array(root->right, array);
}
void Tra_build_tree(struct TreeNode* root, int *array, int left_border, int right_border)
{
    if(root == NULL)
        return ;
    
    int mid = (left_border + right_border)/2;
    root->val = array[mid];

    if(left_border <= mid-1)
    {
        root->left = (struct TreeNode*)malloc(sizeof(struct TreeNode));
        root->left->left = NULL;
        root->left->right = NULL;
        Tra_build_tree(root->left, array, left_border, mid-1);
    }
    if(mid+1 <= right_border)
    {
        root->right = (struct TreeNode*)malloc(sizeof(struct TreeNode));
        root->right->left = NULL;
        root->right->right = NULL;
        Tra_build_tree(root->right, array, mid+1, right_border);
    }
}
struct TreeNode* balanceBST(struct TreeNode* root){
    int *array = (int *)malloc(sizeof(int)*10000);
    array_len = 0;
    Tra_build_array(root, array);
    struct TreeNode * ret = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    ret->left = NULL;
    ret->right = NULL;
    Tra_build_tree(ret, array, 0, array_len-1);
    free(array);
    return ret;
}