We need to construct BST not binary tree.
On Sun, Mar 3, 2013 at 6:19 PM, Krishnan <[email protected]> wrote: > Example: when we have nodes 1,2,3. The Minimum weight is given by, 2->root > 1->left 3->right (Min. Weight - 10) or 3->root 2->left 1->left(left of 2) > (Min. Weight -10). > > > On Sun, Mar 3, 2013 at 5:46 PM, Krishnan <[email protected]>wrote: > >> 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 [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
