class WordDictionary {

public:

    struct TrieNode {

        bool isLeaf;

        TrieNode *child[];

    };

    WordDictionary() {

        root = new TrieNode();

    }

    // Adds a word into the data structure.

    void addWord(string word) {

        TrieNode *p = root;

        for (char c : word) {

            int i = c - 'a';

            if (!p->child[i]) p->child[i] = new TrieNode();

            p = p->child[i];

        }

        p->isLeaf = true;

    }

    // Returns if the word is in the data structure. A word could

    // contain the dot character '.' to represent any one letter.

    bool search(string word) {

        search(word, root, );

    }

    bool search(string &word, TrieNode *p, int i) {

        if (i == word.size()) return p->isLeaf;

        if (word[i] == '.') {

            for (auto a : p->child) {

                if (a && search(word, a, i + )) return true;

            }

            return false;

        } else {

            return p->child[word[i] - 'a'] && search(word, p->child[word[i] - 'a'], i + );

        }

    }

private:

    TrieNode *root;

};