A Red-Black Tree Maintains the Following Invariants

Short Answer

A Red-Black tree maintains the following invariants:
1. A node is either red or black.
2. The root is always __________.
3. A red node always has black children. (A NULL pointer is considered to refer to a black node.)
4. The number of black nodes in any path from the root to a leaf is the same.