resolved errors

Author: Darshan-Baligeri

src/main/java/com/thealgorithms/searches/BinarySearch.java

@@ -62,4 +62,5 @@ private <T extends Comparable<T>> int search(T[] array, T key, int left, int rig
             return search(array, key, median + 1, right);
         }
     }
-}
+}
+

src/main/java/com/thealgorithms/shufflealogrithm/WeightedShuffle.java

@@ -52,4 +52,6 @@ public static void main(String[] args) {
             System.out.print(num + " ");
         }
     }
-}
+}
+
+// Add a newline character here (just press Enter)

src/test/java/com/thealgorithms/datastructures/trees/BinaryTreeTest.java

@@ -1,8 +1,7 @@
 package com.thealgorithms.datastructures.trees;
 
-import static org.junit.jupiter.api.Assertions.*;
-
 import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.Assertions;
 
 public class BinaryTreeTest {
 
@@ -16,11 +15,11 @@ void test1() {
         t.put(9);
         t.put(12);
 
-        assertNotNull(t.find(5), "Node with value 5 should exist in the tree.");
-        assertEquals(5, t.find(5).data);
+        Assertions.assertNotNull(t.find(5), "Node with value 5 should exist in the tree.");
+        Assertions.assertEquals(5, t.find(5).data);
 
-        assertNotNull(t.find(7), "Node with value 7 should exist in the tree.");
-        assertEquals(7, t.find(7).data);
+        Assertions.assertNotNull(t.find(7), "Node with value 7 should exist in the tree.");
+        Assertions.assertEquals(7, t.find(7).data);
     }
 
     // Test for removing data and checking the new root
@@ -38,8 +37,8 @@ void test2() {
         t.remove(5);
         t.remove(7);
 
-        assertNotNull(t.getRoot(), "Root should not be null after removals.");
-        assertEquals(9, t.getRoot().data);
+        Assertions.assertNotNull(t.getRoot(), "Root should not be null after removals.");
+        Assertions.assertEquals(9, t.getRoot().data);
     }
 
     // Test for attempting to remove a nonexistent node
@@ -52,8 +51,8 @@ void test3() {
         t.put(9);
         t.put(12);
 
-        assertTrue(t.remove(9), "Node with value 9 should be removed.");
-        assertFalse(t.remove(398745987),
+        Assertions.assertTrue(t.remove(9), "Node with value 9 should be removed.");
+        Assertions.assertFalse(t.remove(398745987),
                 "Removing a nonexistent node should return false.");
     }
 
@@ -68,7 +67,7 @@ void test4() {
         t.put(12);
 
         // Ensure root is not null before traversal
-        assertNotNull(t.getRoot(), "Root should not be null for traversal.");
+        Assertions.assertNotNull(t.getRoot(), "Root should not be null for traversal.");
 
         // Invoke traversal methods to increase test coverage
         t.bfs(t.getRoot());
@@ -77,8 +76,8 @@ void test4() {
         t.postOrder(t.getRoot());
 
         // Additional assertions
-        assertTrue(t.remove(9), "Node with value 9 should be removed.");
-        assertFalse(t.remove(398745987),
+        Assertions.assertTrue(t.remove(9), "Node with value 9 should be removed.");
+        Assertions.assertFalse(t.remove(398745987),
                 "Removing a nonexistent node should return false.");
     }
-}
+}

src/test/java/com/thealgorithms/searches/BinarySearchTest.java

@@ -105,4 +105,5 @@ void testBinarySearchLargeArray() {
         int expectedIndex = 9999; // Index of the last element
         Assertions.assertEquals(expectedIndex, binarySearch.find(array, key), "The index of the last element should be 9999.");
     }
-}
+}
+

src/test/java/com/thealgorithms/shufflealgorithm/GroupShuffleTest.java

@@ -91,4 +91,5 @@ void testGroupShuffleGroupSizeOne() {
         System.out.println("Shuffled Groups (Group Size One Test): "
                 + shuffledGroups);
     }
-}
+}
+

src/test/java/com/thealgorithms/shufflealgorithm/ShuffleByRangeTest.java

@@ -85,4 +85,5 @@ void testShuffleByRangeLargeArray() {
                     "Elements at index " + i + " should be unchanged");
         }
     }
-}
+}
+

src/test/java/com/thealgorithms/shufflealgorithm/WeightedShuffleTest.java

@@ -49,9 +49,12 @@ void testWeightedShuffleSameWeights() {
         // The order should remain the same or be any permutation since weights are
         // equal
         boolean firstElementMatches =
-                array[0] == 1 ||
-                        array[0] == 2 ||
-                        array[0] == 3 ||
+                array[0] == 1
+                        ||
+                        array[0] == 2
+                        ||
+                        array[0] == 3
+                        ||
                         array[0] == 4;
         Assertions.assertTrue(firstElementMatches);
     }
@@ -95,9 +98,13 @@ void testWeightedShuffleZeroWeights() {
         // The order should remain the same or be any permutation since all weights
         // are equal
         boolean firstElementMatches =
-                array[0] == 5 ||
-                        array[0] == 10 ||
+                array[0] == 5
+                        ||
+                        array[0] == 10
+                        ||
                         array[0] == 15;
         Assertions.assertTrue(firstElementMatches);
     }
-}
+}
+
+// Add a newline character here (just press Enter)