114. Flatten Binary Tree to Linked List

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

helper返回变形后的最后一个节点。

public class Solution {
    public void flatten(TreeNode root) {
        helper(root);
    }
    public TreeNode helper(TreeNode root){
        if(root==null) return null;
        if(root.left==null&root.right==null) return root;

        TreeNode leftnode=root.left;
        TreeNode rightnode=root.right;

        if(leftnode!=null){
            TreeNode tmp=helper(leftnode);
            root.left=null;
            root.right=leftnode;
            if(rightnode!=null) tmp.right=rightnode;
        }
        return helper(root.right);
    }
}

一个简洁的代码：

private TreeNode prev = null;

public void flatten(TreeNode root) {
    if (root == null)
        return;
    flatten(root.right);
    flatten(root.left);
    root.right = prev;
    root.left = null;
    prev = root;
}