Red Black Trees
Red Black Trees Description
In computer science, a red black tree is a specialised binary search tree data structure noted for fast storage
and retrieval of ordered information.
Red Black Tree Rules List
- Every node is either red or black.
- Every leaf (NULL) is 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.