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