int countBT(int N)
{
int count =0;
int count1;
if(N==0)
return 0;
if(N<=1)
return 1;
else
{
for(int j=1;j<=N;j++)
{
count1 = countBT(j-1)
count2 =countBT(N-j);
count+=(count1*count2);
}
return (count);
}
}
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
