How is the time complexity of operations with a Map data structure determined?

In Android, the data structure Map is usually implemented through HashMap or TreeMap, and the time complexity of operations depends on the specific implementation:

• HashMap: insert, search, and delete operations are on average performed in O(1) — constant time, thanks to hashing. In the worst case (with collisions), the complexity can degrade to O(n).

• TreeMap: based on a red-black tree, so insert, search, and delete operations are performed in O(log n).

Thus, the time complexity of Map operations is determined by the implementation used and usually is either O(1) (HashMap) or O(log n) (TreeMap).