ConceptTheory & Algos
AVL tree
AVL trees require the heights of the left and right children of every node to differ by at most plus or minus one.
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
2Each in their own terms, from the easiest level.
Victor Costan
A special kind of binary search tree where for every node, the heights of its left and right subtrees differ by at most one.
Lectures that assume it
1Connections
11The lectures that define it or assume it, and the concepts next to it.