C++ program to perform Insert, Delete, Search an element into a binary search tree

/* Write a C++ Data structure program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from a binary search tree.
c) for a key element in a binary search tree. */

#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;
 
void insert(int,int );
void delte(int);
void display(int);
int search(int);
int search1(int,int);
int tree[40],t=1,s,x,i;
 
main()
{
 int ch,y;
 for(i=1;i<40;i++)
 tree[i]=-1;
 while(1)
 {
cout <<"1.INSERT\n2.DELETE\n3.DISPLAY\n4.SEARCH\n5.EXIT\nEnter your choice:";
  cin >> ch;
  switch(ch)
  {
  case 1:
   cout <<"enter the element to insert";
   cin >> ch;
   insert(1,ch);
   break;
  case 2:
   cout <<"enter the element to delete";
   cin >>x;
   y=search(1);
   if(y!=-1) delte(y);
   else cout<<"no such element in tree";
   break;
  case 3:
   display(1);
   cout<<"\n";
   for(int i=0;i<=32;i++)
   cout <<i;
   cout <<"\n";
   break;
case 4:
   cout <<"enter the element to search:";
   cin >> x;
   y=search(1);
   if(y == -1) cout <<"no such element in tree";
   else cout <<x << "is in" <<y <<"position";
   break;
  case 5:
   exit(0);
  }
 }
}
 
void insert(int s,int ch )
{
 int x;
 if(t==1)
 {
  tree[t++]=ch;
  return;
 }
 x=search1(s,ch);
 if(tree[x]>ch)
  tree[2*x]=ch;
 else
  tree[2*x+1]=ch;
 t++;
}
void delte(int x)
{
 if( tree[2*x]==-1 && tree[2*x+1]==-1)
  tree[x]=-1;
 else if(tree[2*x]==-1)
       { tree[x]=tree[2*x+1];
  tree[2*x+1]=-1;
       }
 else if(tree[2*x+1]==-1)
       { tree[x]=tree[2*x];
  tree[2*x]=-1;
       }
 else
 {
   tree[x]=tree[2*x];
   delte(2*x);
 }
 t--;
}
 
int search(int s)
{
if(t==1)
{
cout <<"no element in tree";
return -1;
}
if(tree[s]==-1)
return tree[s];
if(tree[s]>x)
search(2*s);
else if(tree[s]<x)
search(2*s+1);
else
return s;
}
 
void display(int s)
{
if(t==1)
{cout <<"no element in tree:";
return;}
for(int i=1;i<40;i++)
if(tree[i]==-1)
cout <<" ";
else cout <<tree[i];
return ;
}
 
int search1(int s,int ch)
{
if(t==1)
{
cout <<"no element in tree";
return -1;
}
if(tree[s]==-1)
return s/2;
if(tree[s] > ch)
search1(2*s,ch);
else search1(2*s+1,ch);
}

OUTPUT
1.INSERT
2.DELETE
3.DISPLAY
4.SEARCH
5.EXIT
Enter your choice:3

no element in tree:
0123456789011121314151617181920212223242526272829303132

1.INSERT
2.DELETE
3.DISPLAY
4.SEARCH
5.EXIT
Enter your choice:1

Enter the element to insert 10
1.INSERT
2.DELETE
3.DISPLAY
4.SEARCH
5.EXIT
Enter your choice:4

Enter the element to search: 10
10 is in 1 position
1.INSERT
2.DELETE
3.DISPLAY
4.SEARCH
5.EXIT

Enter your choice:5

CPP FOR DIPLOMA

Searching, Insertion and Deletion.

C++ program to perform Insert, Delete, Search an element into a binary search tree