@Vaibhav: How do you intend to populate the array?
Regards, Sandeep Jain On Wed, Jul 13, 2011 at 9:45 PM, vaibhav shukla <[email protected]>wrote: > @sandeep : then can we just store the nodes in the array.. and as soon as > we reach the leaf ,we print the array . what say ? > > On Wed, Jul 13, 2011 at 8:08 PM, Sandeep Jain <[email protected]>wrote: > >> If we need to find the maximum sum the above code is fine. >> But from the subject it appears we need to print the path, which contains >> the maximum sum, as well. >> >> >> Regards, >> Sandeep Jain >> >> >> >> >> On Wed, Jul 13, 2011 at 8:01 PM, Piyush Kapoor <[email protected]>wrote: >> >>> I agree with anonymous procrastination >>> >>> >>> On Wed, Jul 13, 2011 at 12:38 PM, anonymous procrastination < >>> [email protected]> wrote: >>> >>>> int maxsum(NODEPTR root) >>>> { >>>> if(root==NULL) >>>> return 0; >>>> else >>>> return MAX(maxsum(root->left),maxsum(root->right))+root->data; >>>> } >>>> >>>> >>>> This should work. >>>> Please comment. >>>> >>>> -- >>>> 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. >>>> >>>> >>> >>> >>> -- >>> *Regards,* >>> *Piyush Kapoor,* >>> *CSE-IT-BHU* >>> >>> -- >>> 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. >> > > > > -- > best wishes!! > Vaibhav Shukla > DU-MCA > > -- > 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.
