Lines Matching refs:black
32 * splay trees and red-black trees.
46 * A red-black tree is a binary search tree with the node color as an
49 * same number of black nodes,
50 * - each red node (except for the root) has a black parent,
51 * - each leaf node is black.
53 * Every operation on a red-black tree is bounded as O(lg n).
54 * The maximum height of a red-black tree is 2lg (n+1).
326 #define RB_SET_BLACKRED(black, red, field) do { \
327 RB_COLOR(black, field) = RB_BLACK; \
709 * splay trees and red-black trees.
723 * A red-black tree is a binary search tree with the node color as an
726 * same number of black nodes,
727 * - each red node (except for the root) has a black parent,
728 * - each leaf node is black.
730 * Every operation on a red-black tree is bounded as O(lg n).
731 * The maximum height of a red-black tree is 2lg (n+1).
1003 #define RB_SET_BLACKRED(black, red, field) do { \
1004 RB_COLOR(black, field) = RB_BLACK; \