@milochen
I think your guessing is incorrect.
suppose a tree like this:
Root
/ | \
/ | \
c1 c2 c3
|
c4
in this case, the deepest subtree( root->c1->c4 ) need 2 step to walk
through, but the minimum step to broadcast for the entire tree is 3:
1. root-> c1
2. root-> c2 ; c1-> c4
3. root-> c3
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
