力扣 1382. 将二叉搜索树变平衡 思维+分治

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

思路：首先序列化二叉搜索树，即对其做一次中序遍历得到一个有序数组。每次都选择$l、r$的中间位置的值作为当前节点，分治得到左右子节点即可。

/**
 * 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> vec;
    TreeNode* arrayToTree(int l,int r){
        int mid=(l+r)>>1;
        TreeNode *node=new TreeNode(vec[mid]);
        if(l<mid)
            node->left=arrayToTree(l,mid);
        if(mid+1<r)
            node->right=arrayToTree(mid+1,r);
        return node;
    }
    TreeNode* balanceBST(TreeNode* root) {
        stack<TreeNode*> stk;
        TreeNode *cur=root;
        while(!stk.empty()||cur){
            while(cur){
                stk.push(cur);
                cur=cur->left;
            }
            cur=stk.top();
            stk.pop();
            vec.push_back(cur->val);
            cur=cur->right;
        }
        return arrayToTree(0,vec.size());
    }
};