Implement Trie (Prefix Tree)
Understand how to implement a trie, a prefix tree data structure used for fast string storage and retrieval. This lesson guides you through creating insert, search, and prefix search functions to efficiently handle prefix matching and complete word searches.
We'll cover the following...
Statement
Trie is a tree-like data structure used to store strings. The tries are also called prefix trees because they provide very efficient prefix-matching operations. Implement a trie data structure with three functions that perform the following tasks:
Insert (word): This inserts a word into the trie.
Search (word): This searches the given word in the trie and returns TRUE if the complete word is found (i.e., all characters match and the last node is marked as the end of a word). Otherwise, return FALSE.
Search prefix (prefix): This searches the given prefix in the ...