【二叉树&前序遍历】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

方法就是前序遍历，可以递归也可以非递归，注意是将左子节点转到右支上，所以要将左支置空

/**
 * 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 ;
        
        Stack<TreeNode> s = new Stack<TreeNode>();
        s.push(root);
        TreeNode pre = null;
        while(!s.isEmpty()){
            TreeNode p = s.pop();
            if(pre == null){
                pre = p;
            }
            else{
                pre.left = null;//将左支置空
                pre.right = p;//移植到右支
                pre = p;
                
            }
            
            if(p.right != null) s.push(p.right);
            if(p.left != null) s.push(p.left);
        }
    }
}