Question

Min-max weighted edge given a tree with nodes and bidirectional edges, and given an integer . Now, you have to assign the weights to the edges of this tree such that: the sum of the weights of all the edges is equal to for every possible diameter of the tree, the maximum weight over all the edges covered by its path is the minimum possible you have to output this minimum possible edge weight. Note: the diameter of a tree is the number of nodes on the longest path between two leaves in the tree.

Answer 1

Can't understand please tell in short lauange