ConceptTheory & Algos
AVL tree recurrence
The minimum number of nodes in an AVL tree of height h is given by the recurrence Nₕ = 1 + Nₕ₋₁ + Nₕ₋₂.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.