COMP2123 (ND) Quiz 8

True/False: Suppose we build a Huffman tree T for a character set C with frequency count f. Let c in C be the character with highest frequency, that is f(c) > f(d) for all d in C-c. Then the depthT(c)...