Flatten Binary Tree to Linked List

description:
Flatten a binary tree to a fake “linked list” in pre-order traversal.

Here we use the right pointer in TreeNode as the next pointer in ListNode.

Notice

Don’t forget to mark the left child of each node to null. Or you will get Time Limit Exceeded or Memory Limit Exceeded.

Have you met this question in a real interview? Yes
Example
1
\
1 2
/ \ \
2 5 => 3
/ \ \ \
3 4 6 4
\
5
\
6

没能bug free
解题思路，使用DC的方法不断进行深度搜索，直到最下面一层的最左端的叶子结点，然后对整个binary tree进行整形，是root.left = null然后再次进行遍历直到整理完所有的节点。

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: a TreeNode, the root of the binary tree
     * @return: nothing
     */
    public void flatten(TreeNode root) {
        // write your code here
        util(root);
    }
    private TreeNode util(TreeNode root) {
        if (root == null) {
            return null;
        }
        TreeNode left = util(root.left);
        TreeNode right = util(root.right);
        if (left != null) {
            left.right = root.right;
            root.right = root.left;
            root.left = null;
        }
        if (right != null) {
            return right;
        }
        if (left != null) {
            return left;
        }
        return root;
    }
}