red-black tree

noun

A type of self-balancing binary search tree, typically used to implement associative arrays.

Meanings

nounred-black tree (plural red-black trees)

plural red-black trees

  1. computerA type of self-balancing binary search tree, typically used to implement associative arrays.

Origin

From the colours traditionally used for nodes in diagrams of such trees.

Full word history & related roots →

Translations

Bulgarian черве́но-че́рно дърво́
  • черве́но-че́рно дърво́ (červéno-čérno dărvó)binary search tree
Chinese Mandarin 紅黑樹 /红黑树
  • 紅黑樹 /红黑树 (hónghēishù)binary search tree
Dutch rood-zwartboom
  • rood-zwartboombinary search tree
Finnish punamusta puu
  • punamusta puubinary search tree
German Rot-Schwarz-Baum
  • Rot-Schwarz-Baumbinary search tree
Italian RB-Albero
  • RB-Alberobinary search tree
Portuguese árvore rubro-negra
  • árvore rubro-negrabinary search tree
Spanish árbol rojo-negro
  • árbol rojo-negrobinary search tree
Cite this entry
APA

red-black tree. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/red-black%20tree

MLA

“red-black tree.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/red-black%20tree. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “red-black tree,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/red-black%20tree.

Source: red-black tree on Wiktionary, CC BY-SA 4.0.