Question: Question 16.3.6: (Introduction to Algorithms 3rd Edition) Suppose you have an optimal prefix code on a set C = { c0, c1, , c(n-1) }
Question 16.3.6: (Introduction to Algorithms 3rd Edition)
Suppose you have an optimal prefix code on a set C = { c0, c1, , c(n-1) } of characters and you wish to transmit this code using as few bits as possible. Write an algorithm to represent any optimal prefix code on C using only 2n-1+n*lgnbits. (Hint: Use 2n-1 bits to specify the structure of the tree, as discovered by a walk of the tree.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
