Huffman algorithm uses a greedy approach to generate a postfix-05672

Huffman algorithm uses a greedy approach to generate a postfix code T that minimizes the expected length B(T) of the encoded string.

This multiple choice question (MCQ) is related to the book/course vu cs502 Fundamentals of Algorithms. It can also be found in vu cs502 Final Term - Quiz No.3.