This way we can use lower_bound to find the first prefix match in logarithm time and we know all other prefix matches will follow.