bn:01996181n
Noun Concept
Categories: Amortized data structures, Binary trees, Articles with example C code, 1972 in computer science, Articles containing proofs
EN
red–black tree  Black link  Black red trees  Rb-tree  RB tree
EN
In computer science, a red–black tree is a specialised binary search tree data structure noted for fast storage and retrieval of ordered information, and a guarantee that operations will complete within a known time. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a red–black tree is a specialised binary search tree data structure noted for fast storage and retrieval of ordered information, and a guarantee that operations will complete within a known time. Wikipedia
A type of self-balancing binary search tree used in computer science Wikipedia Disambiguation
Self-balancing binary search tree data structure Wikidata