(List<List<Integer>> list, TreeNode root, int level)
| 22 | } |
| 23 | |
| 24 | private void helper(List<List<Integer>> list, TreeNode root, int level) { |
| 25 | if (root == null) return; |
| 26 | if (level >= list.size()) { |
| 27 | list.add(0, new LinkedList<>()); |
| 28 | } |
| 29 | helper(list, root.left, level + 1); |
| 30 | helper(list, root.right, level + 1); |
| 31 | list.get(list.size() - level - 1).add(root.val); |
| 32 | } |
| 33 | |
| 34 | public static void main(String[] args) { |
| 35 | Solution solution = new Solution(); |