def find(root,word):
    """Returns true if a given words can be found in a trie with the given root """
    node = root
    if not node.children:
        return False
    for char in word:
        char_found = False
        for child in node.children:
            if char == child.char:
                char_found = True
                node = child
                break
        if not char_found:
            return False
    return True