diff --git a/epi_judge_java/epi/SortedListToBst.java b/epi_judge_java/epi/SortedListToBst.java
index d91089994..7656354ba 100644
--- a/epi_judge_java/epi/SortedListToBst.java
+++ b/epi_judge_java/epi/SortedListToBst.java
@@ -25,7 +25,7 @@ public static void compareVectorAndTree(DoublyListNode<Integer> tree,
     compareVectorAndTree(tree.prev, it);
 
     if (!it.hasNext()) {
-      throw new TestFailure("Too few values in the tree");
+      throw new TestFailure("Too many values in the tree");
     }
     if (it.next() != tree.data) {
       throw new TestFailure("Unexpected value");
@@ -52,7 +52,7 @@ public static void buildBSTFromSortedListWrapper(TimedExecutor executor,
     Iterator<Integer> current = l.iterator();
     compareVectorAndTree(inputList, current);
     if (current.hasNext()) {
-      throw new TestFailure("Too many l in the tree");
+      throw new TestFailure("Too few values in the tree");
     }
   }
 
diff --git a/epi_judge_java_solutions/epi/SortedListToBst.java b/epi_judge_java_solutions/epi/SortedListToBst.java
index 03f1ec290..df608a381 100644
--- a/epi_judge_java_solutions/epi/SortedListToBst.java
+++ b/epi_judge_java_solutions/epi/SortedListToBst.java
@@ -51,7 +51,7 @@ public static void compareVectorAndTree(DoublyListNode<Integer> tree,
     compareVectorAndTree(tree.prev, it);
 
     if (!it.hasNext()) {
-      throw new TestFailure("Too few values in the tree");
+      throw new TestFailure("Too many values in the tree");
     }
     if (it.next() != tree.data) {
       throw new TestFailure("Unexpected value");
@@ -78,7 +78,7 @@ public static void buildBSTFromSortedListWrapper(TimedExecutor executor,
     Iterator<Integer> current = l.iterator();
     compareVectorAndTree(inputList, current);
     if (current.hasNext()) {
-      throw new TestFailure("Too many l in the tree");
+      throw new TestFailure("Too few values in the tree");
     }
   }