Suppose we need to distribute a message to all the nodes in a squarerooted tree.
ID: 3698142 • Letter: S
Question
Suppose we need to distribute a message to all the nodes in a squarerooted tree. Initially, only the squareroot node knows the message. In a single round, any node that knows the message can forward, it to at most one of its children. The figure below shows an example tree instance that requires at least 5 rounds. Given as input an arbitrary tree, describe an efficient algorithm to compute the minimum number of rounds required for the message to be delivered to every node. Analyze its complexity with a tight upper bound. The complexity of your algorithm should not be more than O(n^2), where n is the number of nodes.Explanation / Answer
Parrallel Message Delivery:
In figure message has distributed in 5 rounds
A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent to oriented trees (Knuth 1997, pp. 385-399). A tree which is not rooted is sometimes called a free tree, although the unqualified term "tree" generally refers to a free tree.
1.in 1st tree labled node is in root node only
2.In 2nd tree labled node is traverse left sub child
3.In 3rd fig. the labled can be traverse to right child and left child and left sub child
4.In 4th fig. the labled can be traverse 4 levels with sub nodes
5.In 5th fig. the labled traverse 4 levels and except right sub child
6.In 6th fig.labled can be traverse all the labels of the tree
this like tree labe;ls can be transmitted in this diagram
And given snap is not clear .can you please send it clearly