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