Traverse the tree along all possible paths in the tree and calculate sum along all possible ways and store that in an array , and then find out the max and min value in the array >
On Wed, Jul 13, 2011 at 7:32 AM, Rajeev Kumar <[email protected]>wrote: > I want to find the maximum or minimum sum path in binary tree(*not BST*)? > any one have idea? > > -- > Thank You > Rajeev Kumar > > -- > 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 Rajeev N B <http://www.opensourcemania.co.cc> -- 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.
