option A
A red-black tree is a balanced binary search tree with the following properties:
- Every node is colored red or black.
- Every leaf is a NIL node, and is colored black.
- If a node is red, then both its children are black.
- Every simple path from a node to a descendant leaf contains the same number of black nodes.