A red-black tree is a type of self-balancing binary search tree, a data structure used in computing science, typically used to implement associative arrays.
