1382. Balance a Binary Search Tree**

1382. Balance a Binary Search Tree**

https://leetcode.com/problems/balance-a-binary-search-tree/

题目描述

Given a binary search tree, return a balanced binary search tree with the same node values.

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

If there is more than one answer, return any of them.

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,null,null] is also correct.

Constraints:

• The number of nodes in the tree is between 1 and 10^4.
• The tree nodes will have distinct values between 1 and 10^5.

C++ 实现 1

中序遍历 BST. 然后构建新的 balanced BST 时, 总取位于中间的数作为根节点.

class Solution {
private:
    vector<int> res;
    void inorder(TreeNode *root) {
        if (!root) return;
        inorder(root->left);
        res.push_back(root->val);
        inorder(root->right);
    }
    TreeNode* convert(const vector<int> &res, int l, int r) {
        if (l > r) return nullptr;
        int mid = l + (r - l) / 2;
        TreeNode *root = new TreeNode(res[mid]);
        root->left = convert(res, l, mid - 1);
        root->right = convert(res, mid + 1, r);
        return root;
    }
public:
    TreeNode* balanceBST(TreeNode* root) {
        inorder(root);
        return convert(res, 0, res.size() - 1);
    }
};