Binary Search Tree on Employees

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MALLOC(p,s)\
        if(!(p=malloc(s)))\
        {\
          printf("Insufficient Memory\n");\
          exit(0);\
        }  
struct node
{
   struct node *llink;
   char name[20];
   char id[20];
   float sal;
   struct node *rlink;
};
typedef struct node ep;
void inorder(ep *r) 
{
   if(r)
   {
      inorder(r->llink);
      printf("%s %s %f\n",r->name,r->id,r->sal);
      inorder(r->rlink);
   }
}
ep *insert(ep *root,ep *t)
{
   ep *cur=root,*prev=0;
   if(!cur)
      return t;
   while(cur)
   {
      if(!strcmp(t->name,cur->name))
      {
         printf("Reduepancy\n");
         free(t);
         return root;
      }
      prev=cur;
      if(strcmp(t->name,cur->name)<1)
         cur=cur->llink;
      else
         cur=cur->rlink;
   }
   if(strcmp(t->name,prev->name)<1)
      prev->llink=t;
   else
      prev->rlink=t;
   return root;
}
void iterSearch(ep *root)
{
   if(!root)
   {
      printf("BST empty\n");
      return;
   }
   char name[20];
   printf("Enter the name to searched = ");
   scanf("%s",name);
   while(root)
   {
      if(!strcmp(name,root->name))
      {
         printf("Search successful\n"); 
         return;
      }
      if(strcmp(name,root->name)<1)
          root=root->llink;
      else
          root=root->rlink;
   }
   printf("Unsuccessful search\n");
}
void recurSearch(ep *root,char name[])
{
   if(!root)
   {
     printf("Unsuccessful search\n"); 
     return;
   }
   if(!strcmp(name,root->name))
   {
      printf("Successful search\n");
      return;
   }
   if(strcmp(name,root->name)<1)
      return recurSearch(root->llink,name);
   return recurSearch(root->rlink,name);
}
ep *deletenode(ep *root,char name[])
{
   ep *cur,*parent,*q,*suc;
   parent=0;
   cur=root;
   while(cur)
   {
      if(!strcmp(name,cur->name))
      { 
         printf("Employee has been Successfully Deleted\n");
         break;
      }
      parent=cur;
      if(strcmp(name,cur->name)<1)
         cur=cur->llink;
      else
         cur=cur->rlink;
   }
   if(!cur)
   { 
      printf("Employee not found.\nTry searching again!\n");
      return root;
   }
   if(!cur->llink)
      q=cur->rlink;
   else if(!cur->rlink)
      q=cur->llink;
   else
   {
     suc = cur->rlink;
     while(suc->llink)
        suc=suc->llink;
     suc->llink=cur->llink;
     q=cur->rlink;
   }
   if(!parent) 
      return q;

   if(cur == parent->llink)
      parent->llink = q;
   else
      parent->rlink = q;
   free(cur);
   return root;
}
int main()
{
   ep *root=0;
   int ch,i;
   FILE *fp;
   fp=fopen("data2","r");
   if(fp==0)
   {
      printf("File Open Unsuccessfull!\n");
      exit(0);
   }
   for(;;)
   {
       printf("\n1. Insert\n2. Iterative Search\n3. Recursive Search\n");
       printf("4. Inorder\n5. Delete a node\n6. Exit\n");
       printf("Enter choice = ");
       scanf("%d",&ch);
       switch(ch)
       {
           case 1: fscanf(fp,"%d",&ch);
                   for(i=0;i<ch;i++)
                   {
                      ep *t;
                      MALLOC(t,sizeof(ep));
                      fscanf(fp,"%s%s%f",t->name,t->id,&(t->sal));
                      t->llink=t->rlink=0;
                      root=insert(root,t);
                   }
                   break;
           case 2: iterSearch(root);
                   break;
           case 3: printf("Enter the name to searched = ");
                   char name[20];
                   scanf("%s",name);
                   recurSearch(root,name);
                   break;
           case 4: inorder(root);
                   break;
           case 5: printf("Enter the name to deleted = ");
                   scanf("%s",name);
                   root = deletenode(root,name);
                   break;
           case 6: return 0;
       }
  }
}