#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
    int data;
    struct Node *left;
    struct Node *right;
}node;
struct Node* newNode(int val){
struct Node* node(struct Node*)malloc(sizeof(struct Node));
node->data=val;
node->left=node->right=NULL;
return node;
}
struct Node* insert(struct Node* root,int val){
    if(root==NULL)
    return newNode(val);
    if(val<root->data)
    root->left=insert(root->left,val);
    else
    root->right=insert(root->right,val);
    return root;
}
void  levelorder(struct Node* root){
    if(root==NULL)return;
    struct Node* queue[100];
    int front=0,rear=0;
    queue[rear++]=root;
    while(front<rear){
        struct Node*curr=queue[front++];
        printf("%d ",curr->data);
        if(curr->left)
        queue[rear++]=curr->left;
        if(curr->right)
        queue[rear++]=cutt->right;
    }
}
int main(){
    int n,x;
    struct TreeNode* root=NULL;
    sc
}