In Java HashMap, how many nodes can a red-black-tree node have at most before untreeify because it's too small in deletion?

Question

Java doc of the method removeTreeNode of TreeNode in Java HashMap says

If the current tree appears to have too few nodes, the bin is converted back to a