将二叉树展开为链表

题目描述：

给定一个二叉树，原地将它展开为链表。

例如，给定二叉树

    1
   / \
  2   5
 / \   \
3   4   6
将其展开为：

1
 \
  2
   \
    3
     \
      4
       \
        5
         \
          6

解法一：（先进行前序遍历，然后将值存储在一个队列中，再重新构造节点来完成）非递归

代码如下：

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
	//前序遍历返回一个队列
    public Queue<Integer> preorderTraversal(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
        List<Integer> list = new ArrayList<>();
        TreeNode cur = root;
        TreeNode top = null;
        while(cur != null || !stack.isEmpty()){
            if(cur != null){
                list.add(cur.val);
                stack.push(cur);
                cur = cur.left;
            }
            if(cur == null){
                top = stack.pop();
                cur = top.right;
            }
        }
        Queue<Integer> queue = new LinkedList<>();
        Iterator<Integer> iterator = list.iterator();
        while(iterator.hasNext()) {
             queue.offer(iterator.next());
        }
        return queue;
    }
    
    public void flatten(TreeNode root) {
        Queue<Integer> queue = new LinkedList<>();
        queue = preorderTraversal(root);  
        queue.poll();
        while(!queue.isEmpty()) {
            //root = new TreeNode(queue.poll());
            root.left = null;
            root.right = new TreeNode(queue.poll());
            root = root.right;
        } 
    }
}

解法二：直接递归完成，每次新建一个节点来保存右子树即可。全局定义一个节点。(递归解法)

代码如下：
 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    TreeNode cur = null;
    public void flatten(TreeNode root) {
        if(root == null) {
            return;
        }
        if(cur != null) {
            cur.right = root;
            cur.left = null;
        }
        cur = root;//cur节点向右子树移动
        //由于cur节点只记录右子树，类似回溯手段，需要重新拷贝一份进行递归
        TreeNode copyRight = root.right;
        flatten(root.left);
        flatten(copyRight);
    }
}