I'm having trouble with this homework problem. Do I create the tree by beginning with each weight being a leaf? Then combining the lowest weighted leaves, and their parent becomes the sum of their weight?
I got 85 as my answer for (b) but I'm not sure if this is the correct process
Consider the weights: 10, 12, 13, 16, 17, 17.
(a) Construct an optimal coding scheme for the weights given by using a tree.
(b) What is the total weight of the tree you found in part (a)?