Leetcode 103. Binary Tree Zigzag Level Order Traversal

Similar with Binary Tree Level Order Traverse. The difference is reverse the List when it is necessary. 

public class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> ret = new ArrayList<>();
        if (root == null) return ret;
        
        boolean needReverse = false; 
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        
        while (!queue.isEmpty()) {
            int size = queue.size();
            ArrayList<Integer> level = new ArrayList<>();
            for (int i=0; i<size; i++) {
                TreeNode node = queue.poll();
                level.add(node.val);
                if (node.left != null)
                    queue.offer(node.left);
                if (node.right != null)
                    queue.offer(node.right);
            }
            
            // reverse the sequence of current level
            if (needReverse) {
                Collections.reverse(level);
            }
            
            ret.add(level);
            needReverse = !needReverse;
        }
        
        return ret;
    }
}