trie

1 free lesson tagged trie across Computer Science. Each one is a short sequence of focused steps with narration and a five-question quiz at the end — take them in any order, no signup required.

Computer Science

intermediate

Tries and Radix Trees: Structures Keyed by Prefix

A trie stores keys in their spelling rather than hashing them, which buys the one query a hash table cannot answer: find everything starting with this. This lesson covers the trie, the memory problem that makes it impractical, and the radix compression that fixes it and routes the internet.

9 steps·~14 min

Tries and Radix Trees: Structures Keyed by Prefix

Related topics