/// Update a value for the given `key`
/// Returns `false` if key is not found
/// Otherwise returns `true`
pub fn set(self: *Self, key: []const K, value: V) bool {
    var current = &self.root;
    var search = key;
    while (search.len != 0) {
        current = (current.edge(search[0]) orelse return false);

        if (startsWith(K, search, current.prefix, cmp))
            search = search[current.prefix.len..]
        else
            break;
    }

    if (current.leaf) |*leaf| {
       leaf.data = value; // <- Segmentation fault
       return true;
    }
    return false;
}