摘要： ![sicp每日一题[2.71]](https://img2024.cnblogs.com/blog/3223467/202411/3223467-20241106220335444-504604830.png)
Exercise 2.71 Suppose we have a Huffman tree for an alphabet of n symbols, and that the relative frequencies of the symbols are 1,2,4, . . . ,2n 1. Sk 阅读全文
Exercise 2.71 Suppose we have a Huffman tree for an alphabet of n symbols, and that the relative frequencies of the symbols are 1,2,4, . . . ,2n 1. Sk 阅读全文