Leetcode 114. Flatten Binary Tree to Linked List

方法1: postorder-dfs。时间复杂n，空间复杂height of tree。这是一个bottom-up的方法。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public void flatten(TreeNode root) {
        if(root == null) return;
        if(root.left == null && root.right == null) return;
        TreeNode left = root.left;
        TreeNode right = root.right;
        if(left == null) {
            flatten(root.right);
            return;
        }
        root.left = null;
        flatten(left);
        root.right = left;
        TreeNode last = findLast(left);
        flatten(right);
        last.right = right;
    }
    
    public TreeNode findLast(TreeNode root){
        if(root == null) return null;
        while(root.left != null || root.right != null){
            if(root.right != null){
                root = root.right;
                continue;
            }
            if(root.left != null){
                root = root.left;
            }
        }
        return root;
    }
}

这边再给出lc官方解答1，和我是一摸一样的思路，但是在求last node的问题上，他比我要好很多。时间空间复杂和我相同。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    
    private TreeNode flattenTree(TreeNode node) {
        
        // Handle the null scenario
        if (node == null) {
            return null;
        }
            
        // For a leaf node, we simply return the
        // node as is.
        if (node.left == null && node.right == null) {
            return node;
        }
        
        //Recursively flatten the left subtree
        TreeNode leftTail = this.flattenTree(node.left);
        
        // Recursively flatten the right subtree
        TreeNode rightTail = this.flattenTree(node.right);
        
        // If there was a left subtree, we shuffle the connections
        // around so that there is nothing on the left side
        // anymore.
        if (leftTail != null) {
            leftTail.right = node.right;
            node.right = node.left;
            node.left = null;
        }
        
        // We need to return the "rightmost" node after we are
        // done wiring the new connections. 
        return rightTail == null ? leftTail : rightTail;
    }
    
    public void flatten(TreeNode root) {
        
        this.flattenTree(root);
    }
}

方法2: iteration version using stack。我没去实现，复盘自己实现。

方法3: 好像是一个morris 算法，空间复杂只有1。我没看这个算法，复盘时候看一遍并且自己实现。