← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

17 第17章 数据结构的扩张

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

″ in x’s right subtree, so that x.int.low ≤ i″.low. Putting inequalities together, we get

i.high < i′.low ≤ x.int.low ≤ i″.low. Because i.high < i″.low, the interval trichotomy tells us that i and i″ do not overlap. Since we chose i″ as any interval in x’s right subtree, no node in x’s right subtree overlaps i.

▪ Thus, the INTERVAL-SEARCH procedure works correctly. Exercises 17.3-1 Write pseudocode

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea