原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
f z.p. Lines 11–12 constitute case 2, which is shown in Figure 13.6 together with case 3.
In case 2, node z is a right child of its parent. A left rotation immediately transforms the situation into case 3
(lines 13–15), in which node z is a left child. Because both z and z.p are red, the rotat
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea