← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

17 第17章 数据结构的扩张

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

termine x.max in O(1) time, given interval x.int and the max values of node x’s children:

x.max = max {x.int.high, x.left.max, x.right.max}. Thus, by Theorem 17.1, insertion and deletion run in O(lg n) time.

In fact, you can use either Exercise 17.2-3 or 17.3-1 to show how to update all the max a

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea