@@ -0,0 +1,1217 @@
+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            %0A        Queue%3CTreeNode%3E q=new LinkedList%3CTreeNode%3E();%0A            List%3CList%3CInteger%3E%3E r=new ArrayList();%0A            if(root==null)%0A                    return r;%0A            %0A            q.add(root);%0A            while(!q.isEmpty())%0A            %7B%0A                    int count=q.size();%0A                     List%3CInteger%3E l=new ArrayList();%0A                    %0A                    for(int i=0;i%3Ccount;i++)%0A                    %7B%0A                           %0A                           TreeNode curr=q.poll();%0A                           l.add(curr.val);%0A                            if(curr.left!=null)%0A                            q.add(curr.left);%0A                            if(curr.right!=null)%0A                            q.add(curr.right);%0A                    %7D%0A            r.add(l);%0A            %7D%0A     return r;     %0A    %7D%0A%7D%0A

Create TreeLevelOrderTraversal.java