Commit 6dcf4b7

committed

107. Binary Tree Level Order Traversal II (java)

1 parent ec4aab4 commit 6dcf4b7Copy full SHA for 6dcf4b7

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+class Solution {`
	`2`	`+ List<List<Integer>> lists;`
	`3`	`+ public List<List<Integer>> levelOrderBottom(TreeNode root) {`
	`4`	`+ lists = new ArrayList<>();`
	`5`	`+ levelOrderBottom(root,0);`
	`6`	`+ List<List<Integer>> result = new ArrayList<>();`
	`7`	`+ for (int i = lists.size() - 1; i >= 0; i--) result.add(lists.get(i));`
	`8`	`+ return result;`
	`9`	`+ }`
	`10`	`+ private void levelOrderBottom(TreeNode root, int i) {`
	`11`	`+ if (root==null) return;`
	`12`	`+ List<Integer> list;`
	`13`	`+ if (i==lists.size()){`
	`14`	`+ list = new ArrayList<>();`
	`15`	`+ lists.add(list);`
	`16`	`+ }else {`
	`17`	`+ list = lists.get(i);`
	`18`	`+ }`
	`19`	`+ list.add(root.val);`
	`20`	`+ levelOrderBottom(root.left,i+1);`
	`21`	`+ levelOrderBottom(root.right,i+1);`
	`22`	`+ }`
	`23`	`+}`

Comments

(0)