Trie (Prefix Tree)

Implementation of a Trie (Prefix Tree) data structure with support for:

• Word search
• Prefix verification
• Basic autocomplete operations

Time Complexity

• Insert: O(n)
• Search: O(n)
• StartsWith: O(n)

Where n is the length of the word or prefix.

Common Use Cases

This data structure is commonly used in:

• Autocomplete systems (e.g. search bars)
• Text search engines
• Efficient indexing of terms and dictionaries