What is a Trie data structure?

What is a Trie data structure?

Approach: Describe prefix tree for string storage.

An ordered tree data structure used to store a dynamic set or associative array where keys are usually strings. It allows for efficient prefix searches.

Follow-up: What is the time complexity for searching a word of length L?

Key concepts: prefix, nodes, alphabet size.