Sign inSign in

Minimum nodes in an AVL tree of height h

The minimum number of nodes N(h)N(h) for an AVL tree of height hh satisfies the recurrence N(h) = N(h-1) + N(h-2) + 1.
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.