leetcode-problemset/leetcode-cn/problem (English)/特定深度节点链表(English) [list-of-depth-lcci].html

<p>Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you&#39;ll have D linked lists). Return a array containing all the linked lists.</p>

<p>&nbsp;</p>

<p><strong>Example: </strong></p>

<pre>
<strong>Input: </strong>[1,2,3,4,5,null,7,8]

        1
       /  \ 
      2    3
     / \    \ 
    4   5    7
   /
  8

<strong>Output: </strong>[[1],[2,3],[4,5,7],[8]]
</pre>