leetcode JAVA Flatten Binary Tree to Linked List 难度系数3 3.40

Question：

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

click to show hints.

Hints:

If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
     public void flatten(TreeNode root) {
        if(root==null) return;
        visit(root);
    }

	private TreeNode visit(TreeNode cur) {
		if(cur.left==null&&cur.right==null)
			return cur;
		TreeNode left = cur.left;
		TreeNode right = cur.right;
		cur.left = null;
		if(left!=null){
			cur.right = left;
			cur = visit(left);
		}
		if(right!=null){
			cur.right = right;
			cur = visit(right);
		}
		return cur;
	}
}