Flatten Binary Tree to Linked List (Java)

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

         1
        / \
       2   5
      / \   \
     3   4   6

The flattened tree should look like:

   1
    \
     2
      \
       3
        \
         4
          \
           5
            \
             6

本题的意思是将树的先序遍历结果展成一个节点只有右孩子的树，网上还有种非递归的方法，注意学习。

Source

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
	TreeNode nroot = null;
	
    public void flatten(TreeNode root) {
    	if(root == null) return ;
    	
    	TreeNode nright = root.right;
    	
    	if(nroot != null){
    		nroot.right = root; //这里改变了root的right 所以前面要记录一下right
    		nroot.left = null;
    	}
    	nroot = root;    //写在递归前 指向递归节点的父节点
    	flatten(root.left);
    	flatten(nright); //调用老的right
        
    }
}

Test

    public static void main(String[] args){
    	TreeNode a = new TreeNode(1);
    	a.left = new TreeNode(2);
    	a.right = new TreeNode(5);
    	a.left.left = new TreeNode(3);
    	a.left.right = new TreeNode(4);
    	a.right.right = new TreeNode(6);
    	
    	new Solution().flatten(a);
    	while(a != null){
    		System.out.println(a.val);
    		a = a.right;
    	}
    	
    }