Which of the following statements about the multiset container class in the STL is NOT true?
A multiset is an ordered container that can store duplicate elements.
A multiset has fast element insertion and search times.
A multiset does not allow element modification or removal.
A multiset has constant time complexity for element access.
This question is part of this quiz :
C++ Set and Multiset