ConceptTheory & Algos
Compressed trie
A trie where non-branching nodes are contracted into their parents, yielding linear size in the number of leaves while preserving order.
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
1Erik Demaine
Connections
6The lectures that define it or assume it, and the concepts next to it.