red-black tree

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

English[edit]

Noun[edit]

red-black tree (plural red-black trees)

Wikipedia has an article on:

Wikipedia

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

Coordinate terms[edit]

Translations[edit]