mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
20 lines
482 B
HTML
20 lines
482 B
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'll have D linked lists). Return a array containing all the linked lists.</p>
|
|
|
|
<p> </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>
|