Create a Trie Class for Search Suggestions
Learn to create a trie class for search suggestions.
We'll cover the following
A trie, sometimes called a prefix tree, is a type of search tree, commonly used for predictive text and other search applications. A trie is a recursive structure designed for depth-first searches, where each node is both a key and another trie.
A common use case is a trie of strings, where each node is a string in a sentence. For example:
Get hands-on with 1400+ tech skills courses.