we can first count number of nodes in a subtree below each node.Now
transfer message to max(count(root->left),count->root->right);
On 11/1/13, kumar raja wrote:
> Suppose we need to distribute a message to all the nodes in a rooted tree.
> Initially, only the root
> node knows the message. In a s
Suppose we need to distribute a message to all the nodes in a rooted tree.
Initially, only the root
node knows the message. In a single round, any node that knows the message
can forward it
to at most one of its children. Design an algorithm to compute the minimum
number of rounds
required for the
