← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

17 第17章 数据结构的扩张

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

ge returns the position of x in the linear order determined by an inorder tree walk of T.

OS-RANK(T, x) 1 r = x.left.size + 1 // rank of x within the subtree rooted at x 2 y = x // root of subtree being examined 3 while y ≠ T.root 4 if y == y.p.right // if root of a right subtree

… 5 r = r + y.p.left.size + 1 // … add in parent and its left subtree 6 y = y.p // move y

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea