Leetcode-binary Tree Zigzag Level Order Traversal

 1 /**
 2  * Definition for binary tree
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
12         List<List<Integer>> res = new ArrayList<List<Integer>>();
13         if (root==null) return res;
14   
15         List<List<TreeNode>> nodeSet = new ArrayList<List<TreeNode>>();
16         List<TreeNode> oneLevel = new ArrayList<TreeNode>();
17         nodeSet.add(oneLevel);
18         oneLevel.add(root);
19         boolean left = false;
20         int index = 0;
21         while (index<nodeSet.size()){
22             List<TreeNode> curLevel = nodeSet.get(index);
23             oneLevel = new ArrayList<TreeNode>();
24             for (int i=curLevel.size()-1;i>=0;i--){
25                 TreeNode curNode = curLevel.get(i);
26                 if (left){
27                     if (curNode.left!=null) oneLevel.add(curNode.left);
28                     if (curNode.right!=null)oneLevel.add(curNode.right);
29                 } else {
30                     if (curNode.right!=null) oneLevel.add(curNode.right);
31                     if (curNode.left!=null) oneLevel.add(curNode.left);
32                 }
33             }
34             if (oneLevel.size()>0) nodeSet.add(oneLevel);
35             left = !left;
36             index++;
37         }
38 
39         for (int i=0;i<nodeSet.size();i++){
40             oneLevel = nodeSet.get(i);
41             List<Integer> oneRes = new ArrayList<Integer>();
42             for (int j=0;j<oneLevel.size();j++)
43                 oneRes.add(oneLevel.get(j).val);
44             res.add(oneRes);
45         }
46 
47         return res;       
48     }
49 }