// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
int data;
struct node *left;
struct node *right;
}node
node *root=NULL;
node create(int val){
    if(val == 0){
        return NULL;
    }
    node *newnode=(node*)malloc
return newnode
}
node buildtree(int arr[],int n,int i){
    if(root == NULL)
    return NULL;
    node *root = create(arr[i])
    root->left=buildtree(arr,size,2*i+1);
    root->right=buildtree(arr,size,2*i+2);
    return root;
    }
    int main(){
        int size;
        scanf("%d"&h);
        root =insert(root,h);
        node insert(node *root,int h);
        if(root == NULL)
        return create(h);
        if(h<root->data){
            root->left=insert(root->left);
        }
        else
        root->right=insert(root->right);
        return root;
    }
    void inorder(int node *root){
        if(root ==NULL)
        return ;
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
    }
    
}