red–black tree
self-balancing binary search tree data structure
Facts
9 properties- Instance of
- data structure
- Subclass of
- height-balanced binary search tree[3]
- Average space complexity
- O( n )
- Discoverer or inventor
- Rudolf Bayer[2]
- Maintained by WikiProject
- WikiProject Mathematics[8]
- Named by
- Leonidas J. Guibas, Robert Sedgewick[6][7]
- Time of discovery or invention
- 1972[4]
- Worst-case space complexity
- O(n)
🏷️ Also known as
en symmetric binary B-trees
en red–black tree
en RB tree
en red black tree
en red-black tree
ar شجرة حمراء وسوداء
cs červeno-černý strom
cs Černo-červený strom
cs Červenočerný strom
da Rød-sort træ
de RB-Baum
de Schwarz-Rot-Baum
de RS-Baum
de rbtree
de RotSchwarzBaum
de red-black tree
de Rot-Schwarz-Baum
el κόκκινο-μαύρο δέντρο
el ερυθρομαύρο δέντρο
es árbol rojo negro
🔖 Identifiers · 11
- Image (Wikimedia Commons)
- Red-black tree example with NIL.svg ↗
- BabelNet ID
- 01996181n
- Brilliant Wiki ID
- red-black-tree
- Dictionary of Algorithms and Data Structures ID
- redblack
- Freebase ID
- /m/06kyj
- MathWorld ID
- Red-BlackTree
- Microsoft Academic ID (discontinued)
- 126248847
- PlanetMath ID
- RedblackTree
- Rosetta Code page ID
- Red_black_trees
- Stack Exchange tag
- stackoverflow.com
- Zhihu topic ID
- 19648609
🔗 Connections
Named by 2
Different from 1
Discoverer or inventor 1
Instance of 1
Maintained by WikiProject 1
Subtypes 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
red–black tree is a data structure[1].