// editor1
import java.util.Queue;
import java.util.LinkedList;
class Node{
    int data;
    Node left,right;
    Node(int item){
        data=item;
        left=right=null;
    }
}
class BinaryTree{
    Node root;
    void levelOrderTraversal(){
        if(root==null)return;
        Queue<Node>queue=newLinkedList<>();
        queue.add(root);
        while(!queue.isEmpty()){
            Node temp=queue.poll();
            System.out.print(temp.data+" ");