Implement Trie (Prefix Tree)

Explore how to implement a trie data structure that supports inserting words, searching exact strings, and prefix matching. Understand its efficient use for string storage and retrieval, and practice coding these functions to solidify your grasp of tries in interview scenarios.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

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 found. Otherwise, return FALSE.
Search prefix (prefix): This searches the given prefix in the trie and returns TRUE, if found. Otherwise, return FALSE.

...