Commit c28f2f0

committed

103. Binary Tree Zigzag Level Order Traversal (java)

1 parent 186002f commit c28f2f0Copy full SHA for c28f2f0

File tree

+21

-0

lines changed

+21

-0

lines changed

Lines changed: 21 additions & 0 deletions

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

Comments

(0)