Method insert

CPP/Tries/implementTrie.cpp:33–43

    }
    
    void insert(string word) {
        Node* curr = root;
        
        for(auto &ch:word){
            if(curr -> child[ch - 97] == NULL)
                curr -> child[ch - 97] = new Node(ch);
            curr = curr -> child[ch - 97];
        }
        
        curr -> isWord = true;
    }
    
    bool search(string word) {
        Node* reqNode = getNode(word);