We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f37e7a9 commit df5316bCopy full SHA for df5316b
2018.12.05-leetcode102/Sunny.md
@@ -0,0 +1,22 @@
1
+```java
2
+class Solution {
3
+
4
+ private List<List<Integer>> result = new ArrayList<>();
5
6
+ public List<List<Integer>> levelOrder(TreeNode root) {
7
+ levelOrder(root, 0);
8
+ return result;
9
+ }
10
11
+ public void levelOrder(TreeNode node, int level) {
12
+ if (node != null) {
13
+ if (result.size() <= level) {
14
+ result.add(new ArrayList<Integer>());
15
16
+ result.get(level).add(node.val);
17
+ levelOrder(node.left, level+1);
18
+ levelOrder(node.right, level+1);
19
20
21
+}
22
+```
0 commit comments