Noun
red-black tree (plural red-black trees) (computing) A type of self-balancing binary search tree, typically used to implement associative arrays.