insert, delete, max in O(1)

Question

Can someone tell me which data structure supports insert/delete/maximum operation in O(1)?

Answer 1

If you are using only comparisons, you would be hard pressed to find such a data structure.

For instance you could insert n elements, get max, delete max etc and could sort numbers in O(n) time, while the theoretical lower bound is Omega(nlogn).