@@ -0,0 +1,539 @@
+%0A// https://www.hackerrank.com/contests/30-days-of-code/challenges/day-23-review-and-binary-trees/submissions/code/4822505%0A%0A    static void levelOrder(Node root)%7B%0A        Queue%3CNode%3E queue = new LinkedList%3CNode%3E();%0A        queue.add(root);%0A        %0A        while (!queue.isEmpty()) %7B%0A            Node node = queue.remove();%0A            %0A            if (node == null)%0A                continue;%0A%0A            queue.add(node.left);%0A            queue.add(node.right);%0A            %0A            System.out.print(node.data + %22 %22);%0A        %7D%0A    %7D%0A

Create Day2-BinaryTrees.java