Lines Matching full:black
24 * Container class for a red-black tree ......
28 * 1. Every node is either red or black
29 * 2. The root node is black
30 * 3. Every leaf (NIL) is black
31 * 4. If a node is red, both its children are black
33 * contain the same number of black nodes
35 * Due to points 4 & 5, the depth of a red-black tree containing n nodes
53 /* Color enumeration for nodes of red-black tree */
62 typedef enum red_black_color {red, black} rb_color; enumerator
64 /*! Representation of a node in a red-black tree */
77 /* Construct of a red-black tree node
136 /* Traverse a red-black sub-tree
142 /* Representation of a red-black tree */
151 /* Initialize a red-black tree with a comparision function
158 /* Construct a red-black tree with a comparison object
165 /* Clean a red-black tree [takes O(n) operations]
171 /* Destruct a red-black tree
293 * Fix the red-black tree properties after an insertion operation
301 /* Fix the red-black tree properties after a removal operation
308 /* Traverse a red-black tree