i don't understand. why std::unordered_map erase bad performance is O(n) [duplicate]

This question already has an answer here:

• std::unordered_set::erase complexity 3 answers

i'm studying container performance. I was curious about the unordered_map/set erase complexity why bad complexity is O(n) Many thanks.