Red-black Tree: Difference between revisions
Jump to navigation
Jump to search
Line 8: | Line 8: | ||
=Overview= | =Overview= | ||
Red-black trees were invented in 1970s. | |||
* Self-balancing. | * Self-balancing. | ||
* O(log n) operations. | * O(log n) operations. |
Revision as of 04:32, 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
Internal
Overview
Red-black trees were invented in 1970s.
- Self-balancing.
- O(log n) operations.