diff --git a/src/com/jwetherell/algorithms/data_structures/IntervalTree.java b/src/com/jwetherell/algorithms/data_structures/IntervalTree.java
index 3dbd0052..5288903c 100644
--- a/src/com/jwetherell/algorithms/data_structures/IntervalTree.java
+++ b/src/com/jwetherell/algorithms/data_structures/IntervalTree.java
@@ -198,8 +198,8 @@ else if (temp != null)
             } else if (index >= center) {
                 // overlapEnd is sorted by end point
                 List<IntervalData<O>> overlapEnd = new ArrayList<IntervalData<O>>();
-                Collections.sort(overlapEnd,endComparator);
                 overlapEnd.addAll(overlap);
+                Collections.sort(overlapEnd,endComparator);
                 for (IntervalData<O> data : overlapEnd) {
                     if (data.end < index)
                         break;