Python Trie

trie.py

class TrieNode(object):

    ident = None
    children = None

    def __init__(self):
        self.children = {}

    def insert(self, prefix, key=None):
        if prefix:
            try:
                self.children[prefix[0]].insert(prefix[1:], key)
            except KeyError:
                self.children[prefix[0]] = TrieNode().insert(prefix[1:], key)
        elif key:
            self.ident = key

        return self

    def search(self, prefix, key=None):
        if not prefix:
            return self.ident == key if key else True

        try:
            return self.children[prefix[0]].search(prefix[1:], key)
        except KeyError:
            return False

class Trie(TrieNode):

    def insert(self, key):
        return super(Trie, self).insert(key, key)

    def search(self, key):
        return super(Trie, self).search(key, key)