Can radix_tree_update be slightly simplified?

[mihaibudiu]

        let agg = if input.key_valid() && input.key() == input_delta.key() {
            aggregator.aggregate(&mut CursorGroup::new(&mut input, ()))
        } else {
            None
        };

The spec of the aggregate function seems it to require None anyway for an empty input set.