What I can think
is case is :
1
/ \
2 3
/ \
4 5
/ \ \
6 7 8
/ \ \
9 a b
so from a->b is
a->7->4->2->5->8->b
On Sat, Jun 23, 2012 at 2:44 PM, Avinash <jain.av...@gmail.com> wrote:
> Some how I found that we need to run bfs twice to get the largest distance
> between any two nodes of a tree. Please explain me how it works.
> regards,
> avinash
>
> --
> 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/-/jodahB_dChYJ.
> 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
Kumar Vishal
_________________________________________
*http://wethecommonpeople.wordpress.com/ *
*h**ttp://kumartechnicalarticles.wordpress.com/<http://kumartechnicalarticles.wordpress.com/>
*
_________________________________________
--
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.
