@@ -0,0 +1,1208 @@
+/**%0A * Definition of TreeNode:%0A * public class TreeNode %7B%0A *     public int val;%0A *     public TreeNode left, right;%0A *     public TreeNode(int val) %7B%0A *         this.val = val;%0A *         this.left = this.right = null;%0A *     %7D%0A * %7D%0A */%0A%0A%0Apublic class Solution %7B%0A    /*%0A     * @param root: A Tree%0A     * @return: Level order a list of lists of integer%0A     */%0A    public List%3CList%3CInteger%3E%3E levelOrder(TreeNode root) %7B%0A        // write your code here%0A        Queue%3CTreeNode%3E q = new LinkedList%3C%3E();%0A        %0A        List%3CList%3CInteger%3E%3E list = new ArrayList%3CList%3CInteger%3E%3E();%0A        // offer == enqueue%0A        q.offer(root);%0A%0A        while (!q.isEmpty()) %7B%0A%0A            List%3CInteger%3E integerList = new ArrayList%3C%3E();%0A            %0A            while(q.peek() != null) %7B%0A                // poll == dequeue%0A                root = q.poll();%0A                %0A                integerList.add(root.val);%0A    %0A                if (root.left != null) %7B%0A                    q.offer(root.left);%0A                %7D%0A    %0A                if (root.right != null) %7B%0A                    q.offer(root.right);%0A                %7D%0A            %7D%0A            %0A            list.add(integerList);%0A        %7D%0A        return list;%0A    %7D%0A%7D

add 69