Home▸Algorithms & AI▸Tries: The Prefix Tree Behind Autocomplete

🌲 Tries: The Prefix Tree Behind Autocomplete

Explore how a trie (prefix tree) stores strings so that words sharing a prefix share a path, making insertion, search, and prefix queries fast for autocomplete and spell-checking.

Algorithms & AI3DModerate60 FPS

The simulator visualizes a trie growing as words are inserted, highlighting shared-prefix paths and showing how a prefix query lights up only the relevant subtree.

🔬 What It Demonstrates

The simulator visualizes a trie growing as words are inserted, highlighting shared-prefix paths and showing how a prefix query lights up only the relevant subtree.

🎮 How to Use

Type words to insert them into the tree, then enter a prefix to see the matching subtree highlighted along with every word it contains.

💡 Did You Know?

T9 predictive texting on old numeric keypads relied on trie-like prefix structures to guess whole words from just a handful of ambiguous digit presses.

⚙ Under the hood

Explore how a trie (prefix tree) stores strings so that words sharing a prefix share a path, making insertion, search, and prefix queries fast for autocomplete and spell-checking.

trieprefix-treedata-structuresautocompletealgorithmsstring-searchcomputer-sciencesearch-suggestions

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install