Trie.cpp

struct TrieNode {
public:
    void insert(const string& word, int i) {
        
        if (i >= word.size()) {
            return;
        }
        
        if (children[word[i]] == NULL) {
            children[word[i]] = new TrieNode();
        }
            
        children[word[i]]->insert(word, i+1);
        
        if (i == word.size()-1) {
            children[word[i]]->endOfWord = true;
        }
    }
    
    TrieNode* search(const string& word, int i) {
        if (i == word.size() || children[word[i]] == NULL) {
            return NULL;
        }
        
        if (i == word.size()-1) {
            return children[word[i]];
        }
            
        return children[word[i]]->search(word, i+1);
    }
    
    bool endOfWord;
    TrieNode* children[512];
};