@lucifer: in yr code will not all the root->left be NULL for each iteration as startindex is always greater than endindex ( i.e i-1) in the recursive function call??and so for each node only root->right is made? On Fri, Dec 30, 2011 at 12:51 AM, praveen raj <[email protected]> wrote:
> yes... right... > i forget to remove this statement...... > > > PRAVEEN RAJ > DELHI COLLEGE OF ENGINEERING > > > > On Fri, Dec 30, 2011 at 2:17 PM, Lucifer <[email protected]> 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 <[email protected]> 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- "People often say that motivation doesn't last. Well, neither does bathing - that's why we recommend it daily." -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
