How many different binary trees and binary search trees can be made from

three nodes that contain the key values 1, 2 & 3?

one binary search tree and 9 binary trees.

BINARY SEARCH
#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,n,a[100],t,low,mid,high,x,s=0;
clrscr();
printf("\n\t\t\t BINARY SEARCH");
printf("\n\t\t\t =============\n");
printf("\n\t\t ENTER NUMBER OF TERMS:");
scanf("%d",&n);
printf("\n\t\t ENTER THE NUMBERS ONE BY ONE:");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
printf("\n\t\t THE SORTED ELEMENTS ARE:");

for(i=0;i<n;i++)
{
printf("\n\n\t\t\t\t %d",a[i]);
}
printf("\n\n\t\t ENTER THE ELEMENTS TO BE SEARCH:");
scanf("%d",&x);
low = 0;
high = n-1;
while(low <= high)
{
mid = (low+high) / 2;
if(x<a[mid])
{
high = mid-1;
}
else if(x>a[mid])
{
low = mid+1;
}
else
{
s=1;
break;
}
}
if(s == 1)
{
printf("\n\n\t\t THE NUMBER %d IS FOUND IN THE",x);
printf(" POSITION %d",mid+1);
}
else
{
printf("\n\t\t THE NUMBER %d IS NOT FOUND",x);
}

getch();
}

OUTPUT:
BINARY SEARCH
==========
ENTER NUMBER OF TERMS:5
ENTER THE NUMBERS ONE BY ONE:56 34 89 31 22
THE SORTED ELEMENTS ARE:
22
31
34
56
89
ENTER THE ELEMENTS TO BE SEARCH:89
THE NUMBER 89 IS FOUND IN THE POSITION 5

BINARY SEARCH
==========
ENTER NUMBER OF TERMS:5
ENTER THE NUMBERS ONE BY ONE:56 34 89 31 22
THE SORTED ELEMENTS ARE:
22
31
34
56
89

ENTER THE ELEMENTS TO BE SEARCH:88

THE NUMBER 88 IS NOT FOUND