leetcode 208. Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods.

Example:

Trie trie = new Trie();

trie.insert(“apple”); trie.search(“apple”); // returns true
trie.search(“app”); // returns false
trie.startsWith(“app”); // returns true
trie.insert(“app”); trie.search(“app”); // returns true

class TrieNode{
  public:
    TrieNode* child[26];    // the prefix tree can have  26 child
    bool isleaf;            // flag, isleaf
    TrieNode() : isleaf(false){
        for(auto &a : child){
            a = NULL;
        }
    }
    
};

class Trie {
public:
    /** Initialize your data structure here. */
    Trie() {
        root = new TrieNode();
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        TrieNode* tmp = root;
        for(int i = 0; i < word.size(); i++){
            if(tmp -> child[word[i] - 'a'] == NULL){
                tmp -> child[word[i] - 'a'] = new TrieNode();
            }
            tmp = tmp -> child[word[i] - 'a'];
        }
        tmp -> isleaf = true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        TrieNode* tmp = root;
        for(int i = 0; i < word.size(); i++){
            if(tmp -> child[word[i] - 'a'] == NULL){
                return false;
            }
            tmp = tmp -> child[word[i] - 'a'];
        }
        return tmp -> isleaf;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        TrieNode* tmp = root;
        for(int i = 0; i < prefix.size(); i++){
            if(tmp -> child[prefix[i] - 'a'] == NULL){
                return false;
            }
            tmp = tmp -> child[prefix[i] - 'a'];
        }
        return true;
    }
    
private:
    TrieNode* root;
};

/**
 * Your Trie object will be instantiated and called as such:
 * Trie* obj = new Trie();
 * obj->insert(word);
 * bool param_2 = obj->search(word);
 * bool param_3 = obj->startsWith(prefix);
 */