What is the average time complexity of key operations in a TreeMap data structure?

In the data structure TreeMap in Java, operations with keys (insertion, deletion, search) are performed in O(log n) time on average, where n is the number of elements in the map. This is because TreeMap is implemented based on a red-black tree — a balanced binary search tree that provides logarithmic complexity for the main operations.