removed from tests grade-school and binary-search-tree

exercises/binary-search-tree/src/test/java/BinarySearchTreeTest.java

     public void dataIsRetained() {
         BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
 
-        final int expected = 4;
+        int expected = 4;
         binarySearchTree.insert(expected);
 
-        final BinarySearchTree.Node<Integer> root = binarySearchTree.getRoot();
+        BinarySearchTree.Node<Integer> root = binarySearchTree.getRoot();
         assertNotNull(root);
 
-        final int actual = root.getData();
+        int actual = root.getData();
         assertEquals(expected, actual);
     }
 
     @Test
     public void insertsLess() {
         BinarySearchTree<Character> binarySearchTree = new BinarySearchTree<>();
-        final char expectedRoot = '4';
-        final char expectedLeft = '2';
+        char expectedRoot = '4';
+        char expectedLeft = '2';
 
         binarySearchTree.insert(expectedRoot);
         binarySearchTree.insert(expectedLeft);
 
-        final BinarySearchTree.Node<Character> root = binarySearchTree.getRoot();
+        BinarySearchTree.Node<Character> root = binarySearchTree.getRoot();
         assertNotNull(root);
-        final BinarySearchTree.Node<Character> left = root.getLeft();
+        BinarySearchTree.Node<Character> left = root.getLeft();
         assertNotNull(left);
 
-        final char actualRoot = root.getData();
-        final char actualLeft = left.getData();
+        char actualRoot = root.getData();
+        char actualLeft = left.getData();
         assertEquals(expectedLeft, actualLeft);
         assertEquals(expectedRoot, actualRoot);
     }
     @Test
     public void insertsSame() {
         BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>();
-        final String expectedRoot = "4";
-        final String expectedLeft = "4";
+        String expectedRoot = "4";
+        String expectedLeft = "4";
 
         binarySearchTree.insert(expectedRoot);
         binarySearchTree.insert(expectedLeft);
 
-        final BinarySearchTree.Node<String> root = binarySearchTree.getRoot();
+        BinarySearchTree.Node<String> root = binarySearchTree.getRoot();
         assertNotNull(root);
-        final BinarySearchTree.Node<String> left = root.getLeft();
+        BinarySearchTree.Node<String> left = root.getLeft();
         assertNotNull(left);
 
-        final String actualRoot = root.getData();
-        final String actualLeft = left.getData();
+        String actualRoot = root.getData();
+        String actualLeft = left.getData();
         assertEquals(expectedLeft, actualLeft);
         assertEquals(expectedRoot, actualRoot);
     }
     @Test
     public void insertsRight() {
         BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
-        final int expectedRoot = 4;
-        final int expectedRight = 5;
+        int expectedRoot = 4;
+        int expectedRight = 5;
 
         binarySearchTree.insert(expectedRoot);
         binarySearchTree.insert(expectedRight);
 
-        final BinarySearchTree.Node<Integer> root = binarySearchTree.getRoot();
+        BinarySearchTree.Node<Integer> root = binarySearchTree.getRoot();
         assertNotNull(root);
-        final BinarySearchTree.Node<Integer> right = root.getRight();
+        BinarySearchTree.Node<Integer> right = root.getRight();
         assertNotNull(right);
 
-        final int actualRoot = root.getData();
-        final int actualRight = right.getData();
+        int actualRoot = root.getData();
+        int actualRight = right.getData();
         assertEquals(expectedRight, actualRight);
         assertEquals(expectedRoot, actualRoot);
     }
         List<Integer> actual = binarySearchTree.getAsSortedList();
         assertEquals(expected, actual);
     }
-    
+
     @Ignore("Remove to run test")
     @Test
     public void sortsCollectionOfTwoIfSecondNumberisSameAsFirst() {

exercises/grade-school/src/test/java/SchoolTest.java

   @Ignore("Remove to run test")
   @Test
   public void addsMoreStudentsInSameGrade() {
-    final int grade = 2;
+    int grade = 2;
     school.add("James", grade);
     school.add("Blair", grade);
     school.add("Paul", grade);