← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

13 第13章 红黑树

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.692Z

the tree. The total number of times the while loop can be executed is therefore O(lg n).

Thus, RB-INSERT takes a total of O(lg n) time. Moreover, it never performs more than two rotations, since the while loop terminates if case 2 or case 3 is executed.

Exercises 13.3-1 Line 16 of RB-INSERT sets the color of the newly inserted node z to red.

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea