Red-black Tree: Difference between revisions
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
* https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/8acpe/red-black-trees | * https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/8acpe/red-black-trees | ||
* https://www.youtube.com/watch?v=scfDOof9pww | * https://www.youtube.com/watch?v=scfDOof9pww | ||
* https://en.wikipedia.org/wiki/Red%E2%80%93black_tree | |||
=Internal= | =Internal= | ||
Revision as of 04:35, 13 October 2021
External
- https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/8acpe/red-black-trees
- https://www.youtube.com/watch?v=scfDOof9pww
- https://en.wikipedia.org/wiki/Red%E2%80%93black_tree
Internal
Overview
Red-black trees were invented by Bayer (1972) and Guibas, Sedgewick (1978).
- Self-balancing.
- O(log n) operations.