Trie implementation basic

trie.py

class Trie(object):
  def __init__(self):
    self.data = [None for _ in range(26)]
    self.count = 0
    self.is_end = False
  
  def __repr__(self):
    node_data = (lambda x : (1, x.count, x.is_end) if  x is not None else 0)
    return str([node_data(x) for x in self.data])

def add(t, word):
  while len(word) > 0:
    c_idx = ord(word[0]) - ord('a')
    if t.data[c_idx] is None:
      t.data[c_idx] = Trie()
    t.data[c_idx].count += 1
    t = t.data[c_idx]
    word = word[1:]
  t.is_end = True

def find(t, word):
  while len(word) > 0:
    c_idx = ord(word[0]) - ord('a')
    if t.data[c_idx] is None:
      return t.count
    else:
      t = t.data[c_idx]
    word = word[1:]
  return t.count

def show(t):
  print(t)
  for _ in t.data:
    if _ is not None:
      show(_)


def main():
  t = Trie()
  for _ in range(int(input().strip())):
    cmd = input().strip().split(' ')
    if cmd[0] == 'add':
      add(t, cmd[1])
    elif cmd[0] == 'find':
      print(find(t, cmd[1]))
    elif cmd[0] == 'show':
      show(t)

main()