@@ -0,0 +1,597 @@
+//https://www.hackerrank.com/challenges/tree-level-order-traversal%0A%0A/* You only have to complete the function given below.%0A    class Node %7B%0A        int data;%0A        Node left;%0A        Node right;%0A    %7D%0A*/%0A%0Avoid LevelOrder(Node root)%7B%0A    if(root == null)%7B%0A        return;%0A    %7D%0A    Deque%3CNode%3E q = new ArrayDeque%3CNode%3E();%0A    q.push(root);%0A    do %7B%0A        Node node = q.poll();%0A        System.out.print(node.data + %22 %22);%0A        if(node.left != null)%7B%0A            q.add(node.left);%0A        %7D%0A        if(node.right != null)%7B%0A            q.add(node.right);%0A        %7D%0A    %7D while (!q.isEmpty());%0A%7D%0A

Create tree-level-order-traversal.java