[leetcode]5179. 将二叉搜索树变平衡

因为给的是一颗搜索树,所以可以先中序遍历得到升序数组，在递归建立平衡树

/**
 * 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 {
    vector<int>vals;
    void dfs(TreeNode *root)
    {
        if(root != NULL)
        {
            if(root->left != NULL)
            {
                dfs(root->left);
            }
            vals.push_back(root->val);
            if(root->right != NULL)
            {
                dfs(root->right);
            }
        }
    }
    TreeNode* build(int l, int r)
    {
        if(l > r) return NULL;
        int mid = (l+r)>>1;
        TreeNode *newNode = new TreeNode(vals[mid]);
        newNode->left = build(l, mid-1);
        newNode->right = build(mid+1, r);
        return newNode;
    }
public:
    TreeNode* balanceBST(TreeNode* root) {
        dfs(root);
        TreeNode* res = build(0, vals.size()-1);
        return res;
    }
};