原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
red-black tree is a binary search tree that satisfies the following red-black properties:
Every node is either red or black. The root is black. Every leaf (NIL) is black. If a node is red, then both its children are black. For each node, all simple paths from the node to descendant leaves contain the same number of black nodes.
Figure 13.1(a) shows an example of a red-black tree. As a matter of convenience in dealin
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea