- modify the implementation of insert() so that it provides “safeinsert”, i.e.: returns a pair: <pointer, result>, where
- pointer is a pointer to the newly inserted value or the oldvalue with the same key
- result is a boolean value which is true if the element isinserted
- on the basis of your updated insert() implementation, modifythe implementation of the overloaded indexing operator [] toeliminate inefficient second invocation of find(). That is, in yourimplementation, find() should only be invoked once.
- modify the implementation of erase() so that it returns a pair<pointer, result>, where
- pointer is a pointer to the element past one erased. Note thatif the next element
OR
PayPal Gateway not configured
ORPayPal Gateway not configured
- pointer is a pointer to the element past one erased. Note thatif the next element