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