What is the underlying data structure of map

#1

about the data structure of map and the time complexity of find, insert,erase functions in the map container of stl

#2

Hey @Senjuti256 do you want to know the time complexity of find, insert,erase functions in the map container of stl?

#3

yes and also the underlying data structures of map containet

#4

The time complexity of find in map is O(LogN)
Insert & erase also has O(logN) whereas the implementation is of either red black tree or binary search tree :slight_smile:

#5

For more information, you can refer to http://www.cplusplus.com/reference/map/map/

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.