Sign inSign in

Balanced binary search tree

A binary search tree where the height is proportional to the logarithm of the number of nodes, ensuring efficient operations.
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

1

    Lectures that assume it

    5

    Connections

    15

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

    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.