原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
ys an optimal binary search tree, with expected cost 2.75. This example demonstrates that
an optimal binary search tree is not necessarily a tree whose overall height is smallest.
Nor does an optimal binary search tree always have the key with the greatest probability
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea