← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

13 第13章 红黑树

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

f Demaine et al. [109]. Skip lists [369] provide an alternative to balanced binary trees.

A skip list is a linked list that is augmented with a number of additional pointers. Each dictionary operation runs in O(lg n) expected time on a skip list of n items.

1 Although we try to avoid gendered language in this book, the English language lacks a g

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea