Theoremcore
Red-black tree height bound
Also called red-black height lemma.
A red-black tree with n internal nodes has height at most 2 log2(n+1).
A red-black tree with n internal nodes has height at most 2 log2(n+1).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 6S4865 Edit this page History Report an error