原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
leaves need not appear in sorted order and internal nodes do not contain character keys.
An optimal code for a file is always represented by a full binary tree, in which every nonleaf node has two children
(see Exercise 15.3-2). The fixed-length code in our example is not optimal since its tree
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea