原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
hink that setting x.p to y in line 16 is unnecessary since x is a child of y, the call of
RB-DELETE-FIXUP relies on x.p being y even if x is T.nil.
Thus, when z has two children and y is z’s right child, executing line 16 is necessary if
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea