A Trie is a special data structure used to store strings that can be visualized 

like a graph. It consists of nodes and edges. 

Each node consists of at max n children and edges connect each parent node 

to its children. 

These n pointers are nothing but pointers for each of the n characters of 

the alphabet used.