MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / TrieNode

Method TrieNode

CPP/Tries/autoComplete.cpp:27–32  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

25 vector<int>indexes;
26
27 TrieNode(){
28 for (int i=0; i<26; i++){
29 alphabets[i]=NULL;
30 }
31 endOfword=false;
32 }
33};
34
35void insertTrie(TrieNode *root, string &s, int index){

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected