> [!NOTE] Trie in computing > In computer science, a trie, or prefix tree, is an ordered tree-like data structure that can be used to store an associative [[Trie in computing|array]] in which the keys are typically strings of characters. **:: Reference ::** [Trie – Wikipedia, the free encyclopedia (wikipedia.org)](https://en.wikipedia.org/wiki/Trie) **:: Reference ::** [Trie - Wikipedia](https://en.wikipedia.org/wiki/Trie)