red-black tree
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)
- (computing) A type of self-balancing binary search tree, typically used to implement associative arrays.
Hypernyms[edit]
Coordinate terms[edit]
Translations[edit]
binary search tree
|
References[edit]
- red-black tree on Wikipedia.Wikipedia