TrieNode* TrieNode::insertChild(std::string& nextCharacter) { if (!findChild(nextCharacter)) { __map.insert(std::pair<std::string, TrieNode>(nextCharacter, TrieNode(nextCharacter, __dataSize))); return &(__map.find(nextCharacter)->second); } return NULL; }
// Initialize your data structure here. TrieNode() { TrieNode('0'); }