input: Write a python function to create a Trie structure that can insert words.
  assert t.insert('apple') == {'a': {'p': {'p': {'l': {'e': {'name': True}}}}}}
  assert t.insert('app') == {'a': {'p': {'p': {'l': {'e': {'name': True}}, 'name': True}}}}
  assert t.insert('banana') == {'a': {'p': {'p': {'l': {'e': {'name': True}}, 'name': True}}}, 'b': {'a': {'n': {'a': {'n': {'a': {'name': True}}}}}}}
output: class Trie:
      def __init__(self):
          self.root = {}
  
      def insert(self, word):
          node = self.root
          for char in word:
              if char not in node:
                  node[char] = {}
              node = node[char]
          node['name'] = True
          return self.root
  
  t = Trie()