Design a data structure that supports adding new words and finding if a string matches any previously added string.

• void addWord(String word)
• boolean search(String word) — supports . as a wildcard matching any single letter.

Example:

addWord("bad"), addWord("dad"), addWord("mad")
search("pad")→false, search("bad")→true, search(".ad")→true, search("b..")→true