Sign inSign in

Compressed trie

A trie where non-branching nodes are contracted into their parents, yielding linear size in the number of leaves while preserving order.
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.

Trie3Binary trie1Non-branching nodes1Tree data structures1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Erik Demaine

    MIT · Graduate

Connections

6

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

Concepts4

Lectures2

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.