← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

17 第17章 数据结构的扩张

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.706Z

ncludes a useful theorem that allows you to augment red-black trees easily in many cases.

You can break the process of augmenting a data structure into four steps: Choose an underlying data structure. Determine additional information to maintain in the underlying data structure. Verify that you can maintain the additional information for the basic modifying operations on the underlying data structure. Develop new operations. As with any prescriptive design method, you’ll rarely be able to follow the steps precisely in the order given. Most design work contains an element of trial and error, and progress on all steps usually proceeds in parallel. There is no point, for example, in determining additional information and developing new operations (steps 2 and 4) if you cannot maintain the additional information efficiently.

Nevertheless, this four-step method provides a good focus for your efforts in augmenting

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter017.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea