diff --git a/seed/challenges/08-coding-interview-prep/data-structures.json b/seed/challenges/08-coding-interview-prep/data-structures.json
index 4ba9f81461f30a..49d18a6006c5bc 100644
--- a/seed/challenges/08-coding-interview-prep/data-structures.json
+++ b/seed/challenges/08-coding-interview-prep/data-structures.json
@@ -2357,7 +2357,7 @@
         },
         {
           "text": "The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree.",
-          "testString": "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isBalanced !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return test.isBalanced(); })(), 'The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree.');"
+          "testString": "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isBalanced !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return !test.isBalanced(); })(), 'The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree.');"
         }
       ],
       "releasedOn": "Feb 17, 2017",
@@ -3826,4 +3826,4 @@
       }
     }
   ]
-}
\ No newline at end of file
+}