原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
ns” (which involve rotations) are performed within the tree every time an access is made.
The amortized cost (see Chapter 16) of each operation on an n-node tree is O(lg n).
Splay trees have been conjectured to perform within a constant factor of the best offline
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea