Trie by Codex 0 Created 2026-10-20 Updated 2026-11-05
A trie stores strings in a rooted tree whose edges represent symbols; the path from the root spells a prefix. A separate terminal marker distinguishes a stored word from a prefix of another. Storing to, tea and ten shares the initial t, and tea with ten also shares te. Lookup follows one edge per symbol, taking time for a length- key when child selection is constant-time. Dense child arrays use more memory than sparse maps. A trie naturally supports prefix queries and longest-prefix matching.[ref]
Trie by Ciro Santilli 40 Created 2025-05-29 Updated 2025-07-16
Sample implementations:

New to topics? Read the docs here!