将二叉树按照层级转化为链表

将二叉树按照层级转化为链表

题目：

描述
给一棵二叉树，设计一个算法为每一层的节点建立一个链表。也就是说，如果一棵二叉树有 D 层，那么你需要创建 D 条链表。

样例
样例 1:

输入: {1,2,3,4}
输出: [1->null,2->3->null,4->null]
解释: 
        1
       / \
      2   3
     /
    4
样例 2:

输入: {1,#,2,3}
输出: [1->null,2->null,3->null]
解释: 
    1
     \
      2
     /
    3

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    /**
     * @param root the root of binary tree
     * @return a lists of linked list
     */
    public List<ListNode> binaryTreeToLists(TreeNode root) {
        // Write your code here
        List<ListNode> ans = new ArrayList();
        if(root == null) {
            return ans;
        }

        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);

        while(!queue.isEmpty()) {
            int size = queue.size();
            ListNode head = new ListNode(0);
            ListNode cur = head;
            for(int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                ListNode listNode = new ListNode(node.val);
                if(node.left != null) {
                    queue.offer(node.left);
                }

                if(node.right != null) {
                    queue.offer(node.right);
                }

                cur.next = listNode;
                cur = cur.next;
            }
            ans.add(head.next);
        }

        return ans;
    }
}