red–black tree
self-balancing binary search tree data structure
Press Enter · cited answer in seconds
0 sources
red–black tree
Summary
red–black tree is a data structure[1]. It ranks in the top 10% of data_structure entities by monthly Wikipedia readership (5,345 views/month).[2]
Key Facts
- red–black tree is credited with the discovery of Rudolf Bayer[3].
- red–black tree's instance of is recorded as data structure[4].
- red–black tree is a type of height-balanced binary search tree[5].
- red–black tree's Commons category is recorded as Red-black trees[6].
- red–black tree's time of discovery or invention is recorded as 1972[7].
- red–black tree's Stack Exchange tag is recorded as https://stackoverflow.com/tags/red-black-tree[8].
- red–black tree's different from is recorded as AVL tree[9].
- red–black tree's named by is recorded as Leonidas J. Guibas[10].
- red–black tree's named by is recorded as Robert Sedgewick[11].
- red–black tree's maintained by WikiProject is recorded as WikiProject Mathematics[12].
Why It Matters
red–black tree ranks in the top 10% of data_structure entities by monthly Wikipedia readership (5,345 views/month).[2] It has Wikipedia articles in 26 language editions, a strong signal of global cultural recognition.[13] It is known by 62 alternative names across languages and contexts.[14]