The word trie is an infix of the word “retrieval” because the trie can find a single word in a dictionary with only a prefix of the word.
In some Trees, nodes are given meaning by the path to them from the root node. In such trees any single node only encodes one part of the meaning; the data from all the nodes in the path must be combined to extract the complete message.
A Trie is such a tree. In a Trie each node encodes a single letter and each each path represents a word. Because it's true that there is a single path to any one node, it's fair to say that an individual node represents a word, although it only encodes a single letter.
https://gist.github.com/HamidAghdaee/799ad24c6d80facbdcfecdb2ea0a9ed1