原书出处
Introduction to Algorithms, Fourth Edition
17 第17章 数据结构的扩张
e left of i′ (i.e., i.high < i′.low), c. i is to the right of i′ (i.e., i′.high < i.low).
An interval tree is a red-black tree that maintains a dynamic set of elements, with each element x containing an interval x.int.
Interval trees support the following operations: INTERVAL-INSERT(T, x) adds the element x
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter017.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea