File tree Expand file tree Collapse file tree 1 file changed +31
-0
lines changed Expand file tree Collapse file tree 1 file changed +31
-0
lines changed Original file line number Diff line number Diff line change
1
+ # LeetCode 102
2
+ /**
3
+ * Definition for a binary tree node.
4
+ * public class TreeNode {
5
+ * int val;
6
+ * TreeNode left;
7
+ * TreeNode right;
8
+ * TreeNode(int x) { val = x; }
9
+ * }
10
+ */
11
+ class Solution {
12
+ public List<List<Integer>> levelOrder(TreeNode root) {
13
+ List<List<Integer>> lists = new ArrayList<>();
14
+ if (root == null) {
15
+ return lists;
16
+ }
17
+ dfs(lists, root, 0);
18
+ return lists;
19
+ }
20
+ private static void dfs(List<List<Integer>> lists, TreeNode root, int level) {
21
+ if (root == null) {
22
+ return;
23
+ }
24
+ if (lists.size() < level + 1) {
25
+ lists.add(new ArrayList<Integer>());
26
+ }
27
+ lists.get(level).add(root.val);
28
+ dfs(lists,root.left,level+1);
29
+ dfs(lists,root.right,level+1);
30
+ }
31
+ }
You can’t perform that action at this time.
0 commit comments