Skip to content

Commit b20b497

Browse files
committed
LC #102
1 parent 3b1e722 commit b20b497

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
/*
2+
102. Binary Tree Level Order Traversal
3+
Medium
4+
5+
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
6+
7+
For example:
8+
Given binary tree [3,9,20,null,null,15,7],
9+
3
10+
/ \
11+
9 20
12+
/ \
13+
15 7
14+
15+
return its level order traversal as:
16+
[
17+
[3],
18+
[9,20],
19+
[15,7]
20+
]
21+
*/

0 commit comments

Comments
 (0)