finding end nodes of the diameter can be found in the below link :-
http://groups.google.com/group/algogeeks/browse_thread/thread/8b6e326b75904d9a/92839f502d671599?hl=enlnk=gstq=Two+most+distant+element+in+tree#92839f502d671599
after finding 2 nodes we just need to find path between those 2
We have seen the question of computing the diameter of binary tree. Any
ideas to compute the path of nodes along that diameter? No parent pointer
exists.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web
