Wiki › Skill
Trie data structure
Article
ReadAll pages
From Chaipat's knowledge graph
No article has been written for this page yet; it is generated from the knowledge graph.
About Trie · from Wikipedia
In computer science, a trie, also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree, nodes in a trie do not store their associated key. Instead, each node's position within the trie determines its associated key, with the connections between nodes defined by individual characters rather than the entire key.
Summary from Wikipedia ↗, CC BY-SA 4.0.
Related work
- Word games engine Key work Jun 2026
It uses a Trie, a prefix tree, so pattern and anagram searches only follow paths that can still form words.