A simple Python Trie data structure implementation

trie.py

#   A simple Trie implementation


class Node:
    def __init__(self):
        self.children = dict()
        self.count = 0


class Trie:
    def __init__(self):
        self.root = Node()

    def insert(self, word):
        curr = self.root

        for i in range(len(word)):
            curr = curr.children.setdefault(i, Node())

        curr.count += 1

    def find(self, word):
        curr = self.root

        for i in word:
            if i in curr.children:
                curr = curr.children[i]
            else:
                raise ValueError("Not found")

        if curr.count > 0:
            return True
        else:
            raise ValueError("Not found")