In computer science, a Trie, also called digital tree or Prefix tree, is a type of k-ary search tree, a Tree Data structure used for locating specific keys from within a set. These keys are most often strings, with links between [Vertices] defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the trie is traversed Depth-first, following the links between nodes, which represent each character in the key.
Bibliography
“Trie.” 2022. Wikipedia, September. https://en.wikipedia.org/w/index.php?title=Trie&oldid=1109798282.