check for a*&ao*,even tough they are search heuristics, some modification of the algorithm would solve the problem.
On Mon, May 30, 2011 at 12:56 AM, ross <[email protected]> wrote: > Given a binary tree(not a BST) find the 2 nodes of the binary tree > which are separated by maximum distance. > By distance, we mean no. of edges in the path from node1 to node2. > > -- > 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.
