ConceptTheory & Algos
Minimum nodes in an AVL tree of height h
The minimum number of nodes for an AVL tree of height satisfies the recurrence N(h) = N(h-1) + N(h-2) + 1.
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.
AVL tree invariant1Recurrence relation1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.