Let $$C$$ be an alphabet in which each character $$c$$ in $$C$$
Let $$C$$ be an alphabet in which each character $$c$$ in $$C$$ has frequency $$c.freq$$. If the size of $$C$$ is $$n$$, the length of the optimal prefix code for any character $$c$$ is not greater than $$n-1$$. ~@[](2)答案：TRUE
