Sign inSign in
ConceptSystems & CS

Balanced tree

Trees designed to avoid degenerate cases by keeping the height logarithmic relative to the number of nodes.
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.

Lecturers

2

Each in their own terms, from the easiest level.

  • David J. Malan

    Harvard University · Undergraduate

    A tree structure where the height is kept minimal to ensure efficient operations.

Connections

4

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

Concepts2

Lectures2

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.