C++ How to find the biggest key in a std::map?

Question

At the moment my solution is to iterate through the map to solve this.

I see there is a upper_bound method which can make this loop faster, but is there

Answer 1

Since the map is just an AVL tree then, it's sorted -in an ascending order-. So, the element with largest key is the last element and you can obtain it using one of the following two methods:

1.

    largestElement = (myMap.rbegin())-> first; // rbegin(): returns an iterator pointing to the last element

2.  largestElement = (--myMap.end())->first; // end(): returns an iterator pointing to the theortical element following the last element