I need to use a data structure, implementable in C++, that can do basic operations, such as lookup, insertion and deletion, in constant time. I, however, also need to be able to find the maximum value in constant time.This data structure should probably be sorted to find the maximum values and I have looked into red-black trees, however they have logarithmic-time operations.
Data structure with constant time operations
data structures;efficiency;dictionaries;constant time