For a non-selfbalancing binary search tree, finding the minimum in the worst case can take O(N) and average case O(log(N)) to traverse to the corresponding leaf node.
Per CPPreference, the time complexity of the function std::map::begin() is constant. Therefore extending this a little further, de-referencing std::map::begin() which yields the lowest key by default also takes constant time. Can someone explain why this might be the case?