Well, as described in today's lecture, a trie is* a tree, just like a binary search tree is a tree. A trie is a particular application of a tree data structure that is useful for encoding possible sequences of characters in a dictionary or other collection of strings.
See today's lecture notes for a brief overview. |