原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
e start with an observation about subtrees. Consider any subtree of a binary search tree.
It must contain keys in a contiguous range ki,
…, kj, for some 1 ≤ i ≤ j ≤ n. In addition, a subtree that contains keys ki, …, kj must a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea