LeetCode 1382. Balance a Binary Search Tree

将一颗二叉搜索树变平衡

二叉搜索树的特点：不管结构如何，中序遍历序列不变

So 先得到中序序列，再构建平衡树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    ArrayList<Integer> mid_order = new ArrayList<Integer>();
    public TreeNode balanceBST(TreeNode root) {
        Stack<TreeNode> s = new Stack<>();
        if(root == null)
            return null;
        s.push(root);
        TreeNode head = root.left;
        while(!s.empty() || head!=null){
            if(head!=null){
                s.push(head);
                head = head.left;
            }else{
                head = s.pop();
                mid_order.add(head.val);
                head = head.right;
            }
        }
        int n = mid_order.size();
        TreeNode ans = getnode(0,n);
        return ans;
    }
    public TreeNode getnode(int l, int r){
        if(l>=r)
            return null;
        if(r==l+1)
            return new TreeNode(mid_order.get(l));
        int mid = (l+r)/2;
        TreeNode ans = new TreeNode(mid_order.get(mid));
        ans.left = getnode(l,mid);
        ans.right = getnode(mid+1,r);
        return ans;
    }
}