【每日一题】897. 递增顺序搜索树

897. 递增顺序搜索树

https://leetcode-cn.com/problems/increasing-order-search-tree/

思路：
中序遍历，处理根节点的时候，重新构建新树

public class Solution {
    TreeNode p = new TreeNode(0);
    TreeNode dummy = p;
    public TreeNode increasingBST(TreeNode root) {
        inorder(root);
        return dummy.right;
    }

    public void inorder(TreeNode root){
        if(root != null){
            inorder(root.left);
            TreeNode tmp = new TreeNode(root.val);
            p.right = tmp;
            p = p.right;
            inorder(root.right);
        }
    }
}