LeetCode#897: Increasing Order Search Tree

Description

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

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

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

Solution

第一种方式是使用中序遍历将树中每个节点的值加入到一个List中去，然后用List中的值顺序取出并构建题目要求的单（右）边递增树：

class Solution {
    public TreeNode increasingBST(TreeNode root) {
        List<Integer> order = new ArrayList<>();
        rearrange(root, order);
        TreeNode res = new TreeNode(-1);
        TreeNode curr = res;
        for(Integer val : order) {
        	curr.right = new TreeNode(val);
        	curr = curr.right;
        }
        return res.right;
    }
    
    private void rearrange(TreeNode root, List<Integer> order) {
    	if(root == null)
    		return;
    	rearrange(root.left, order);
    	order.add(root.val);
    	rearrange(root.right, order);
    }
}

这种方式不会修改原树，但由于使用ArrayList存储中序遍历的值，因此该算法的空间复杂度为O(n)。还可以通过重新连接节点来构造一个题目要求的树的形状：

class Solution {
	TreeNode curr;
	
    public TreeNode increasingBST(TreeNode root) {
    	TreeNode node = new TreeNode(-1);
    	curr = node;
    	rearrange(root);
    	return node.right;
    }
    
    private void rearrange(TreeNode root) {
    	if(root == null)
    		return;
    	rearrange(root.left);
    	curr.right = root;
    	root.left = null;
    	curr = root;
    	rearrange(root.right);
    }
}