int maxsum(NODEPTR root) { if(root==NULL) return 0; else { if((maxsum(root->left)>maxsum(root->right)) printf("%d",root->left); else printf("%d",root->right); return MAX(maxsum(root->left),maxsum(root->right))+root->data; } }
-- 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.