What is the time complexity of operations in a HashMap when a tree is used inside to resolve collisions?

When a tree (such as a red-black tree) is used in a HashMap to resolve collisions, the time complexity of the main operations becomes:

• Search (get): O(log n) in the worst case, where n is the number of elements in a single bucket.
• Insert (put): O(log n) in the worst case.
• Remove (remove): O(log n) in the worst case.

This is an improvement over using linked lists for collisions, where in the worst case, operations have a complexity of O(n). Using a tree allows maintaining performance even with a large number of collisions.