原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
rd. A binary tree whose leaves are the given characters provides one such representation.
Interpret the binary codeword for a character as the simple path from the root to that character, where 0 means “go to the left child” and 1 means “go to the right child.”
Figure 15.5 shows the trees for the two codes of our example. Note that these are not bin
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea