Given a set of numbers, we have to construct a tree such that their WEIGHT is MINIMUM. WEIGHT(node value * height of the node).
(Root is at the height 1). we need to print the minimum weight. How to approach this problem ? Pls somebody help.... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
