RedBlackTree
Implementation of a Red/Black Tree data structure, serving as a base for specialized data structures such as maps and sets.
This class is not safe for concurrent modifications, no locks are used and adding/removing/updating values while iterating will cause unspecified behavior.