Q1.What is a trie (prefix tree) primarily optimized for?
Q2.What is the time complexity of inserting a word of length L into a trie?
Q3.How do multiple words sharing a common prefix get stored in a trie?
Q4.What marks the end of a valid word within a trie's nodes?
