请问，我怎么能简洁的证明这个Huffman tree 问题？# Programming - 葵花宝典
t*s
1 楼
请问，我怎么能简洁的证明这个Huffman tree 问题？
Suppose T is a Huffman tree, and that the leaf for symbol a has greater
depth than the leaf for symbol b. Prove that the probability of symbol b is
no less than that of a.
谢谢
Suppose T is a Huffman tree, and that the leaf for symbol a has greater
depth than the leaf for symbol b. Prove that the probability of symbol b is
no less than that of a.
谢谢
