原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
and then the pointer x moves up the tree at most O(lg n) times, performing no rotations.
Thus, the procedure RB-DELETE-FIXUP takes O(lg n) time and performs at most three rotations, and the overall time for RB-DELETE is therefore also O(lg n).
Exercises 13.4-1 Show that if node y in RB-DELETE is red, then no black-heights change. 1
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea