Trie was described in a computer context by Rene de la Briandais in 1959. Independently, Edward Fredkin described the data structure as a `Trie` (pronouncing it `/ˈtriː/`). Trie comes from the middle syllable of `reTRIEval`. In order to distinguish that from a word „tree”, other authors pronounce it as `/ˈtraɪ/` . ### See also 1. [[What is Trie?]] ### Reference 1. [Trie Wikipedia Page](https://en.m.wikipedia.org/wiki/Trie)