A brief Introduction to Tries
Trie is a kind of search tree. It’s commonly used for storing and searching single characters that make up one or more strings. A use-case of this is in the routing layer of a web framework to see which IP address belong to a class. This article gives some brief introductuon to trie. Hope you can find more places to apply it after this.
Appears in lists (1)