原书出处
Introduction to Algorithms, Fourth Edition
17 第17章 数据结构的扩张
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