原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
eaf is black), since both children of the newly inserted red node are the sentinel T.nil.
Property 5, which says that the number of black nodes is the same on every simple path from a given node, is satisfied as well, because node z replaces the (black) sentinel, and node z is red with sentinel children.
Thus, the only properties that might be violated are property 2, which requires the root
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea