HashMap treeify threshold — why linked list to red-black tree?

HashMap treeify

When a hash bucket grows beyond 8 nodes (and table length ≥ 64), Java 8+ HashMap converts that bucket's linked list into a red-black tree keyed by hash order—worst-case lookup drops from O(n) to O(log n)…