Sign inSign in

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.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Victor Costan

    MIT · Undergraduate

    A special kind of binary search tree where for every node, the heights of its left and right subtrees differ by at most one.
    • 9:06AVL Trees (MIT 6.006 Introduction to Algorithms, Recitation 6)

Lectures that assume it

1

Connections

11

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

2 lecturers. 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.