Now really before review.

Author: coderodde

src/main/java/com/github/coderodde/util/Benchmark.java

@@ -4,7 +4,7 @@
 import java.util.Random;
 
 public class Benchmark {
-//    
+   
     private static final int WARMUP_INT_ARRAY_LENGTH = 100_000;
     private static final int WARMUP_INT_UPPER_BOUND = 1_000;
     private static final int RANDOM_DATA_LENGTH = 1_000_000;

src/main/java/com/github/coderodde/util/IntTreeSortV2.java

@@ -1,7 +1,9 @@
 package com.github.coderodde.util;
 
 /**
- *
+ * This class implements the variation of integer tree sort where instead of 
+ * collision chains we use collision trees.
+ * 
  * @author Rodion "rodde" Efremov
  * @version 1.0.0 (Aug 30, 2024)
  * @since 1.0.0 (Aug 30, 2024)

src/main/java/com/github/coderodde/util/IntTreeSortV3.java

@@ -1,7 +1,10 @@
 package com.github.coderodde.util;
 
 /**
- *
+ * This class implements the variation of integer tree sort where instead of 
+ * collision chains we use collision trees. Also, it adds the 
+ * <i>hook optimization</i>.
+ * 
  * @author Rodion "rodde" Efremov
  * @version 1.0.0 (Aug 30, 2024)
  * @since 1.0.0 (Aug 30, 2024)
@@ -130,6 +133,7 @@ private void sort() {
                                 newnode);
 
                 if (previousParent != null) {
+                    // Hook optimization:
                     if (currentElement < previousParent.key) {
                         previousParent.left = newEntry;
                     } else {