Trie Data Structure

Implement a trie (prefix tree) and support operations like insertion, search, and delete. Trie is used for efficient retrieval of keys in a dataset of strings.