Use recursion with the code as follows
void add(node *root, int *sum) { } On Tue, Oct 18, 2011 at 8:58 AM, sravanreddy001 <sravanreddy...@gmail.com>wrote: > I that is what is suggested in the above code. Even here you can avoid the > sorting and add all with same x coordinate.. O(n) space as suggested.. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/CZ2rgqRAlW0J. > 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. > > -- Regards, Rahul Patil -- 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.