ConceptTheory & Algos
Compressed trie linear-time construction
A compressed trie can be constructed in linear time by inserting elements one by one in order and using an amortization argument based on the length of the rightmost path.
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
1Connections
4The lectures that define it or assume it, and the concepts next to it.