simpletrie.py

def make_trie(rows):
    trie = {}
    for row in rows:
        key = row[0]
        value = row[1]
        trie_append(trie, key, value)
    return trie


def trie_append(node, key, value):
    for c in key:
        if c not in node:
            node[c] = dict()
        node = node[c]
    node['value'] = value


def trie_find(node, key):
    for c in key:
        if c not in node:
            return False
        node = node[c]
    return node['value']