← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

13 第13章 红黑树

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

this chapter omits the leaves in drawings of red-black trees, as shown in Figure 13.1(c).

We call the number of black nodes on any simple path from, but not including, a node x down to a leaf the black-height of the node

, denoted bh(x). By property 5, the notion of black-height is well defined, since all desc

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea