Lines Matching full:black

98 .Nd "array-based red-black trees"
185 These macros define data structures for and array-based red-black trees.
215 A red-black tree is a binary search tree with the node color as an
221 black nodes.
223 Each red node (except for the root) has a black parent.
225 Each leaf node is black.
228 Every operation on a red-black tree is bounded as
230 The maximum height of a red-black tree is
244 A red-black tree is headed by a structure defined by the
267 creates a red-black tree head structure with 8-bit signed array indices capable
370 The red-black tree can also be initialized statically by using the
449 macro should be used to check whether a red-black tree is empty.