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

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

晴宝儿

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

阅读量360

点赞数

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

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

版权

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 ;