ConceptTheory & Algos
AVL tree height bound
The height of an AVL tree with n nodes is because the minimum number of nodes grows exponentially with height.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.