Increasing Order Search Tree

Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.

Example 1:
Input: [5,3,6,2,4,null,8,1,null,null,null,7,9]

       5
      / \
    3    6
   / \    \
  2   4    8
 /        / \ 
1        7   9

Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]

 1
  \
   2
    \
     3
      \
       4
        \
         5
          \
           6
            \
             7
              \
               8
                \
                 9  

Note:

1. The number of nodes in the given tree will be between 1 and 100.
2. Each node will have a unique integer value from 0 to 1000.

 

题目理解：

按照中序遍历顺序重新创建二叉树

解题思路：

先用递归记录中序遍历顺序，然后重新建立二叉树。

这里要注意，在重现建立二叉树的时候要删除原有的子节点

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<TreeNode> list = new ArrayList<>();
    
    public void dfs(TreeNode root){
        if(root == null)
            return;
        dfs(root.left);
        list.add(root);
        dfs(root.right);
    }
    
    public TreeNode increasingBST(TreeNode root) {
        dfs(root);
        TreeNode head = new TreeNode(0);
        TreeNode it = head;
        for(TreeNode node : list){
            node.left = null;
            node.right = null;
            it.right = node;
            it = it.right;
        }
        return head.right;
    }
}