Category: Trees & BSTs
Difficulty: intermediate
Description: Efficient string storage and retrieval
Time Complexity: O(m)
Space Complexity: O(n*m)