Problem
1. Give an efficient algorithm for deleting a string from a compressed trie and analyze its running time.
2. Describe an algorithm for constructing the compact representation of a suffix trie, given its noncompact representation, and analyze its running time.