Design a data structure that supports the following two operations:
search(word) can search a literal word or a regular expression string containing only letters
.. A . means it can represent any one letter.
You may assume that all words are consist of lowercase letters