剑指 Offer II 052. 展平二叉搜索树

艰难的求职刷题之路day5：整体思路先中序遍历放入list中，之后在重新创建一颗树，让list的值为树的右节点，虽然整体思路简单，但是c++第一次转Java完全不知道该怎么写orz，加油吧

/**
 * 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 {
    public TreeNode increasingBST(TreeNode root) 
    {
         List<Integer> res = new ArrayList<Integer>();//创建list容器
         inorder(root,res);
         TreeNode head=new TreeNode(-1);
         TreeNode cur=head;
         for (int value : res)//遍历整个list并让其中的值成为树的结点
         {
             cur.right=new TreeNode(value);
             cur=cur.right;
         }
         return head.right;
    }
    public void inorder(TreeNode root,List<Integer> res)//中序遍历
    {
        if(root==null)
        {
            return ;
        }
        inorder(root.left,res);
        res.add(root.val);
        inorder(root.right,res);
    }
}