The basic rules is the following: Suppose we have a hierarchy with 4 nodes. The root node is A, node A's left child is B, and node A's right child is D; and node B has only a single child node C.
The fastest broadcast scheme is for A to call B in the first round. In the second round, A calls D; B calls C. If A were to call D first, then C could not learn the news until the third round. --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
