I said linked list and it was wrong. what changed in Java 8
It starts as a linked list, but when one bucket gets more than 8 entries it's converted to a red-black tree, so the worst case becomes O(log n). Only if the table capacity is at least 64 though, below that it resizes instead.
@Akash with a small table collisions are more likely just because the table is small. resizing spreads them out and trees use more memory per node
and know the equals/hashCode contract, that's always the next question
why resize first?
Structured lessons on DSA, core CS, Java and interview skills, each ending in a quiz so you know it stuck.