Method insert

cpp/Tries/design_a_trie.cpp:26–39

    }

    void insert(std::string word) {
        TrieNode* node = root;
        for (char c : word) {
            // For each character in the word, if it's not a child of
            // the current node, create a new TrieNode for that 
            // character.
            if (node->children.find(c) == node->children.end()) {
                node->children[c] = new TrieNode();
            }
            node = node->children[c];
        }
        // Mark the last node as the end of a word.
        node->isWord = true;
    }

    bool search(std::string word) {
        TrieNode* node = root;