This is about the trie data structure

Important Tips

  1. Dont forget that each Node should have a boolean to mark the end of a word
  2. When Inserting through the root to the correct child node, if a character doesnt exit, create a new node
  3. When removing a string make sure to check if each node is the end of a string

trie tree

Here is a link to more info on Tries: hacker earth