← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

17 第17章 数据结构的扩张

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

erval in the tree that overlaps i, the procedure returns a pointer to the sentinel T.nil.

INTERVAL-SEARCH(T, i) 1 x = T.root 2 while x ≠ T.nil and i does not overlap x.int 3 if x.left ≠ T.nil and x.left.max ≥ i.low 4 x = x.left // overlap in left subtree or no overlap in right subtree 5 else x = x.right // no overlap in left subtree 6 return x

The search for an interval that overlaps i starts at the root of the tree and proceeds do

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea