binary-search-tree: add pattern in use of generics in tests

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

@@ -90,78 +90,78 @@ public class BinarySearchTreeTest {
     @Ignore("Remove to run test")
     @Test
     public void createsComplexTree() {
-        BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
-        List<Integer> expected = Collections.unmodifiableList(
-                Arrays.asList(4, 2, 6, 1, 3, 5, 7)
+        BinarySearchTree<Character> binarySearchTree = new BinarySearchTree<>();
+        List<Character> expected = Collections.unmodifiableList(
+                Arrays.asList('4', '2', '6', '1', '3', '5', '7')
         );
 
-        List<Integer> treeData = Collections.unmodifiableList(
-                Arrays.asList(4, 2, 6, 1, 3, 7, 5)
+        List<Character> treeData = Collections.unmodifiableList(
+                Arrays.asList('4', '2', '6', '1', '3', '7', '5')
         );
         treeData.forEach(binarySearchTree::insert);
 
-        List<Integer> actual = binarySearchTree.getAsLevelOrderList();
+        List<Character> actual = binarySearchTree.getAsLevelOrderList();
         assertEquals(expected, actual);
     }
 
     @Ignore("Remove to run test")
     @Test
     public void sortsSingleElement() {
-        BinarySearchTree<Character> binarySearchTree = new BinarySearchTree<>();
-        List<Character> expected = Collections.unmodifiableList(
-                Collections.singletonList('4')
+        BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>();
+        List<String> expected = Collections.unmodifiableList(
+                Collections.singletonList("4")
         );
 
-        binarySearchTree.insert('4');
+        binarySearchTree.insert("4");
 
-        List<Character> actual = binarySearchTree.getAsSortedList();
+        List<String> actual = binarySearchTree.getAsSortedList();
         assertEquals(expected, actual);
     }
 
     @Ignore("Remove to run test")
     @Test
     public void sortsCollectionOfTwoIfSecondInsertedIsSmallerThanFirst() {
-        BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>();
-        List<String> expected = Collections.unmodifiableList(
-                Arrays.asList("2", "4")
+        BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
+        List<Integer> expected = Collections.unmodifiableList(
+                Arrays.asList(2, 4)
         );
 
-        binarySearchTree.insert("4");
-        binarySearchTree.insert("2");
+        binarySearchTree.insert(4);
+        binarySearchTree.insert(2);
 
-        List<String> actual = binarySearchTree.getAsSortedList();
+        List<Integer> actual = binarySearchTree.getAsSortedList();
         assertEquals(expected, actual);
     }
 
     @Ignore("Remove to run test")
     @Test
     public void sortsCollectionOfTwoIfSecondInsertedIsBiggerThanFirst() {
-        BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
-        List<Integer> expected = Collections.unmodifiableList(
-                Arrays.asList(4, 5)
+        BinarySearchTree<Character> binarySearchTree = new BinarySearchTree<>();
+        List<Character> expected = Collections.unmodifiableList(
+                Arrays.asList('4', '5')
         );
 
-        binarySearchTree.insert(4);
-        binarySearchTree.insert(5);
+        binarySearchTree.insert('4');
+        binarySearchTree.insert('5');
 
-        List<Integer> actual = binarySearchTree.getAsSortedList();
+        List<Character> actual = binarySearchTree.getAsSortedList();
         assertEquals(expected, actual);
     }
 
     @Ignore("Remove to run test")
     @Test
     public void iteratesOverComplexTree() {
-        BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
-        List<Integer> expected = Collections.unmodifiableList(
-                Arrays.asList(1, 2, 3, 4, 5, 6, 7)
+        BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>();
+        List<String> expected = Collections.unmodifiableList(
+                Arrays.asList("1", "2", "3", "4", "5", "6", "7")
         );
 
-        List<Integer> treeData = Collections.unmodifiableList(
-                Arrays.asList(4, 2, 1, 3, 6, 7, 5)
+        List<String> treeData = Collections.unmodifiableList(
+                Arrays.asList("4", "2", "1", "3", "6", "7", "5")
         );
         treeData.forEach(binarySearchTree::insert);
 
-        List<Integer> actual = binarySearchTree.getAsSortedList();
+        List<String> actual = binarySearchTree.getAsSortedList();
         assertEquals(expected, actual);
     }
 }