red–black tree
Sign in to saveAlso known as red-black tree, red black tree, symmetric binary B-trees, RB tree
self-balancing binary search tree data structure
Key facts
- Type
- Tree
- Invented by
- Leonidas J. Guibas and Robert Sedgewick
via Wikipedia infobox
Wikidata facts
- Instance of
- data structure
- Image
- Red-black tree example with NIL.svg
Show 7 more facts
- Commons category
- Red-black trees
- Stack Exchange tag
- stackoverflow.com/tags/red-black-tree
- time of discovery or invention
- 1972-00-00
- different from
- AVL tree
- discoverer or inventor
- Rudolf Bayer
- named by
- Robert Sedgewick
- maintained by WikiProject
- WikiProject Mathematics
Sources (1)
via Wikidata · CC0
~40 min read
Encyclopedic overview
Example of a red-black tree
In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information. The nodes in a red-black tree hold an extra "color" bit, often drawn as red and black, which help ensure that the tree is always approximately balanced.
Excerpted from Wikipedia’s “red–black tree” article, available under the CC BY-SA 4.0 licence.