原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
terminates, because property 4 is satisfied: there are no longer two red nodes in a row.
Case 1. z’s uncle y is red Figure 13.5 shows the situation for case 1 (lines 5–8), which occurs when both z.p and y are red. Because z’s grandparent z.p.p is black, its blackness can transfer down one level to both z.p and y, thereby fixing the problem of z and z.p both being red. Having had its blackness transferred down one level, z’s grandparent becomes red, thereby maintaining property 5.
The while loop repeats with z.p.p as the new node z, so that the pointer z moves up two l
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea