原书出处
Introduction to Algorithms, Fourth Edition
17 第17章 数据结构的扩张
ndpoint in x’s left subtree, we have i′.high ≤ x.left.max. Thus, as Figure 17.5(a) shows,
i′.high ≤ x.left.max < i.low. By the interval trichotomy, therefore, intervals i and i′ do not overlap, and so x’s left subtree contains no interval that overlaps i.
Figure 17.5 Intervals in the proof of Theorem 17.2. The value of x.left.max is shown in e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter017.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea