原书出处
Introduction to Algorithms, Fourth Edition
17 第17章 数据结构的扩张
trees that do not bound the number of rotations per insertion or deletion by a constant.
If each operation might require Θ(lg n) rotations and each rotation traverses a path up to the root, then a single operation could require Θ(lg2n) time, rather than the O(lg n) time bound given by Theorem 17.1.
Exercises 17.2-1 Show, by adding pointers to the nodes, how to support each of the dynami
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter017.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea