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