Problem
1. What is a trie?
2. How may a trie with six levels and a five-way branch in each node differ from the rooted tree with six levels and five children for every node except the leaves? Will the trie or the tree likely have fewer nodes, and why?
3. Discuss the relative advantages in speed of retrieval of a trie and a binary search tree.