原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
t most one child and line 9 when z has two children. Because node y’s color might change,
the variable y-original-color stores y’s color before any changes occur.
Lines 2 and 10 set this variable immediately after assignments to y. When node z has two
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea