Trie and Prefix Structure BuilderPREMIUM

## CONTEXT
The trie is a specialized tree that stores strings by shared prefixes, making it the right tool for autocomplete, prefix search, word-dictionary problems, and certain bitwise maximum-XOR problems. Candidates often miss the trie opportunity and reach for slower hash-map scans, or they implement the trie node…