IMPLEMENTATION OF RECURSIVE BINARY SEARCH TREE PROGRAM

IMPLEMENTATION OF RECURSIVE BINARY SEARCH TREE



PROGRAM:



#include

#include

#define size 10

int n;

void main()

{

int a[size],flag,i,key,low,high;

int binsearch(int a[size],int key,int low,int high);

clrscr();

printf("\n How many are there in array");

scanf("%d",&n);

printf("\n Enter the Element");

for(i=0;i
scanf("%d",&a[i]);

printf("\n Enter the Element which is to be searched");

scanf("%d",&key);

low=0;

high=n-1;

flag=binsearch(a,key,low,high);

printf("\n Element a[%d] location",flag);

getch();

}

int binsearch(int a[size],int key,int low,int high)

{

int m;

m=(low+high)/2;

if(key==a[m])

return m;

else if(key
binsearch(a,key,low,m-1);

else

binsearch(a,key,m+1,high);

}



















OUTPUT:



How many are there in array 5



Enter the Element

1

2

3

4

5



Enter the Element which is to be searched 3



Element a [2] location











CIET college Programs,LAB Programs for Engineering Students,DAA LAB Programs,DSA LAB Programs,Remoboys,karthik,Remokn,Student3k,programs source code,Design Analysis And Algorithms LAB Programs,Data Structures and Algorithms LAB Programs,LAB Codings,Coimbatore Institute of Engineering and Technology ( CIET )