Under what conditions does HashMap switch to using tree-based structures for organizing elements within its buckets?

HashMap in Java switches to using tree-based structures (specifically, red-black trees) inside buckets when the number of elements in a single bucket exceeds a threshold (usually 8). This is done to improve search performance in case of many collisions, reducing access time from O(n) to O(log n).