@@ -0,0 +1,1201 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public List%3CList%3CInteger%3E%3E zigzagLevelOrder(TreeNode root) %7B%0A        List%3CList%3CInteger%3E%3E list = new ArrayList%3CList%3CInteger%3E%3E();%0A        if(root == null) return list;%0A        Queue%3CTreeNode%3E q = new LinkedList%3CTreeNode%3E();%0A        q.add(root);%0A        int cur = 1;%0A        int nxt = 0;%0A        boolean flag = false;%0A        List%3CInteger%3E tmp = new ArrayList%3CInteger%3E();%0A        while(!q.isEmpty()) %7B%0A            TreeNode node = q.poll();%0A            cur--;%0A            if(!flag) tmp.add(node.val);%0A            else tmp.add(0, node.val);%0A            if(node.left != null) %7B%0A                q.add(node.left);%0A                nxt++;%0A            %7D%0A            if(node.right != null) %7B%0A                q.add(node.right);%0A                nxt++;%0A            %7D%0A            if(cur == 0) %7B%0A                list.add(new ArrayList%3CInteger%3E(tmp));%0A                cur = nxt;%0A                nxt = 0;%0A                tmp.clear();%0A                flag = !flag;%0A            %7D%0A        %7D%0A        return list;%0A    %7D%0A%7D%0A

Create Binary_Tree_Zigzag_Level_Order_Traversal.java