Lines Matching refs:black
39 * splay trees and red-black trees.
53 * A red-black tree is a binary search tree with the node color as an
56 * same number of black nodes,
57 * - each red node (except for the root) has a black parent,
58 * - each leaf node is black.
60 * Every operation on a red-black tree is bounded as O(lg n).
61 * The maximum height of a red-black tree is 2lg (n+1).
297 /* Macros that define a red-black tree */
333 #define RB_SET_BLACKRED(black, red, field) do { \
334 RB_COLOR(black, field) = RB_BLACK; \