search(key, node) {
    if key == ""
        // The value of the node is the searched one
        return node->value
          
    nextNode = child corresponding to the first letter of the key
    
    if nextNode does not exist
        return NULL
    
    return search(key without first letter, nextNode) 
}