描述

給一棵二叉樹，設計一個算法為每一層的節(jié)點建立一個鏈表。也就是說，如果一棵二叉樹有D層，那么你需要創(chuàng)建 D 條鏈表。

樣例

對于二叉樹：

    1
   / \
  2   3
 /
4
返回 3 條鏈表：
[
  1->null,
  2->3->null,
  4->null
]

代碼實現(xiàn)

/**
 * 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) {
        List<ListNode> result = new ArrayList<>();
        if (root == null) {
            return result;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        ListNode dummy = new ListNode(0);
        ListNode lastNode = null;
        //result輸出[1-2-3-null,  1-2-3-null,1-2-3-null]
        //dummy.next = null;
        //lastNode = dummy;
        while(!queue.isEmpty()) {
           //遍歷完一層后重新將dummy和lastNode 初始化
            dummy.next = null;
            lastNode = dummy;
            //TreeNode node = queue.poll();
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                lastNode.next = new ListNode(node.val);
                lastNode = lastNode.next; 
                if (node.left != null) {
                    queue.offer(node.left);
                }
                if (node.right != null) {
                    queue.offer(node.right);
                }
            }
            result.add(dummy.next);
        }
        return result;
    }
}