原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
es either 2 or 1, respectively, to the count of black nodes on simple paths containing x.
The color attribute of x will still be either RED (if x is red-and-black) or BLACK (if x is doubly black).
In other words, the extra black on a node is reflected in x’s pointing to the node rather
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea