coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -0,0 +1,19 @@
<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>