red-black tree

Definition from Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

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

Noun[edit]

red-black tree (plural red-black trees)

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

Hypernyms[edit]

Coordinate terms[edit]

Translations[edit]

References[edit]