原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
hat happens to the expected search cost of a subtree when it becomes a subtree of a node?
The depth of each node in the subtree increases by 1.
By equation (14.11), the expected search cost of this subtree increases by the sum of all
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea