@@ -1 +1,1212 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode() %7B%7D%0A *     TreeNode(int val) %7B this.val = val; %7D%0A *     TreeNode(int val, TreeNode left, TreeNode right) %7B%0A *         this.val = val;%0A *         this.left = left;%0A *         this.right = right;%0A *     %7D%0A * %7D%0A */%0Aclass Solution %7B%0A    public List%3CList%3CInteger%3E%3E levelOrder(TreeNode root) %7B%0A        List%3CList%3CInteger%3E%3E res = new LinkedList%3C%3E();%0A        List%3CTreeNode%3E curlevel = new LinkedList%3C%3E();%0A        List%3CTreeNode%3E nextLevel;%0A        curlevel.add(root);%0A        while(curlevel.size() %3E 0) %7B%0A            nextLevel = new LinkedList%3C%3E();%0A            List%3CInteger%3E levelValues = new LinkedList%3C%3E();%0A            for (TreeNode node : curlevel) %7B                %0A                if (node == null) %7B%0A                    continue;%0A                %7D%0A                levelValues.add(node.val);%0A                nextLevel.add(node.left);%0A                nextLevel.add(node.right);%0A            %7D%0A            curlevel = nextLevel;%0A            if (levelValues.size() %3E 0) %7B%0A                res.add(levelValues);%0A            %7D            %0A        %7D%0A        return res;%0A    %7D%0A%7D%0A
 %0A

Update LevelOrder102.java