Theoremcore
AVL height bound
Also called AVL height theorem.
An AVL tree with n nodes has height at most about 1.44 log2(n), since the minimum node count at height h is a Fibonacci-like recurrence.
An AVL tree with n nodes has height at most about 1.44 log2(n), since the minimum node count at height h is a Fibonacci-like recurrence.
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 1K7PH7 Edit this page History Report an error