二叉树展开为链表

题目：

思路：
利用二叉树的先序遍历，每次遍历时将右孩子入栈，左孩子连接，遍历完之后单链表形成。
代码：

/**
 * 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) {
        Stack<TreeNode> stack = new Stack();
        TreeNode node = root, end = root;

        /**
         * 每次将该节点的非空右孩子进栈，左孩子变为右孩子，然后将自己赋值为右孩子
         */
        while(node != null || !stack.empty()) {
          while(node != null) {
            if(node.left != null) {
              if(node.right != null) {
                stack.push(node.right);
              }
              node.right = node.left;
              node.left = null;
            }
            end = node;
            node = node.right;
          }
          
          if(!stack.empty())
            node = stack.pop();
          /**
           * end用来将断开的栈中节点连起来
           */
          end.right = node;
        }
    }
}