#include<stdio.h>
#include<stdlib.h>
typedef struct node {
    in data;
    struct node *right,*left;
}Node;
Node* head=NULL;
Node* create(int num) {
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
Node* insert(Node *root,num) {
    if(root==NULL)
    return create(num);
    if(num>root->data) {
        root->right=insert(root->right,num);
    }
    else if(num<root->data)
    root->left=insert(root->left,num);
    return root;
}
void inOrder(Node *root) {
    if(root!=NULL)
    {
        inOrder(root->left);
        printf("%d",root->data);
        inOrder(root->right);
    }
}
Node* search(Node* root,int num) {
    if(root)
}