Right!! that is pretty standard problem but the solution u have given is for undirected graphs and intuitively binary trees are directed. Piyush solution will work for binary tree.
On May 30, 2:04 am, anshu mishra <[email protected]> wrote: > this is a very standard problem :D > > start with any node(x) find the node which is at maximum distance. > > now start with x travese the tree and find the node(y) which is at maximum > distance. > > so finally answer wil be (x, y) > > traversing the tree two times. so the order for finiding the such nodes > equals to O(n); -- 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.
