// editor2
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left;
    struct node *right;
}Node;
node*create(int num){
    Node *newnode(Node*)malloc(sizeof(Node))
    newnode->newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}
Node *insert(Node *root,int num){
    if(root==NULL){
        return createe(num);
    }
    if(num<root->data){
        root->left=insert(root->left,num);
        
    }
else{ 
    root->right=inser(root->left,num);
}
return root;
}
void levelOrder(Node*root,temp)
if(root==NULL)
return ;
Node *queue[100] front=root=0;
queue[rear++]=root
while(front<rear){
    Node*current=queue[front++];
    printf("%d",current->data);
    if(current->left){
        queue[rent++]=current->;
        if(current->right)
        queue[rent]=current->right;
    }
    return ;
}