@@ -0,0 +1,1281 @@
+import java.io.*;%0Aimport java.util.*;%0Aclass Node%7B%0A    Node left,right;%0A    int data;%0A    Node(int data)%7B%0A        this.data=data;%0A        left=right=null;%0A    %7D%0A%7D%0Aclass Solution%7B%0A%0A%09static void levelOrder(Node root)%7B%0A        Queue%3CNode%3E q = new LinkedList%3CNode%3E();%0A%09%09if (root == null) return;%0A%09%09q.add(root);%0A        boolean b = false;%0A%09%09while (!q.isEmpty()) %7B%0A%09%09%09Node n = (Node) q.remove();%0A%09%09%09System.out.print((b? %22 %22 : %22%22)+n.data);%0A            b = true;%0A%09%09%09if (n.left != null) q.add(n.left);%0A%09%09%09if (n.right != null) q.add(n.right);%0A%09%09%7D%0A    %7D%0A%0A%09public static Node insert(Node root,int data)%7B%0A        if(root==null)%7B%0A            return new Node(data);%0A        %7D%0A        else%7B%0A            Node cur;%0A            if(data%3C=root.data)%7B%0A                cur=insert(root.left,data);%0A                root.left=cur;%0A            %7D%0A            else%7B%0A                cur=insert(root.right,data);%0A                root.right=cur;%0A            %7D%0A            return root;%0A        %7D%0A    %7D%0A    public static void main(String args%5B%5D)%7B%0A            Scanner sc=new Scanner(System.in);%0A            int T=sc.nextInt();%0A            Node root=null;%0A            while(T--%3E0)%7B%0A                int data=sc.nextInt();%0A                root=insert(root,data);%0A            %7D%0A            levelOrder(root);%0A        %7D%09%0A%7D%0A

Create Day_23_BST_Level_Order_Traversal.java