How come all the operations can be constant time?


Does not that imply that we find an O(n) sorting algorithm ?


you can achieve all the operations mentioned in the requirements in O(1) time complexity. Think of how you would maintain a value, x, as well as a min value in a data structure, without sorting. hope this helps!