Trie
5 videos • 6 views • by LetsCode The Trie data structure, also known as a prefix tree, is a tree-like data structure used to store a dynamic set of strings where the keys usually represent words or sequences of characters. The Trie is particularly efficient for tasks involving prefix searches and string lookups.