What type of tree is used inside the TreeMap data structure?

The TreeMap data structure in Java uses a Red-Black Tree. This is a balanced binary search tree that provides logarithmic time complexity for basic operations such as insertion, deletion, and search. The Red-Black Tree maintains balance through rules of node coloring and rotations, ensuring efficiency and orderliness of elements in the TreeMap.