yes... right...
i forget to remove this statement......
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
On Fri, Dec 30, 2011 at 2:17 PM, Lucifer <sourabhd2...@gmail.com> wrote:
> @praveen
>
> I think what u are doing above is the following:
> Say, F(n) denotes the no. of binary trees that can be formed using N
> elements given the inorder sequence..
>
> F(n) = SumOver(i= 1 to N) { F(i-1) * F(N-i) }
>
> which is nothing but..
> F(N) = (2n C n)/ (n+1) i.e. catalan's no.
>
> Also, i would like to mention that in ur code probably u need to
> remove the following condition otherwise u result outcome will always
> be zero..
>
> *
> if(N==0) return 0;
>
>
> On 30 Dec, 13:41, praveen raj <praveen0...@gmail.com> wrote:
> > 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.
>
>
--
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.
