Update ReverseQueueRecursionTest.java

Author: Vasundhara117

src/test/java/com/thealgorithms/datastructures/queues/ReverseQueueRecursionTest.java

@@ -1,16 +1,15 @@
 package com.thealgorithms.datastructures.queues;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
-
 import static org.junit.jupiter.api.Assertions.assertTrue;
 
 import java.util.LinkedList;
-
 import java.util.Queue;
-
 import org.junit.jupiter.api.Test;
 
 class ReverseQueueRecursionTest {
+
+    @Test
     void testReverseMultipleElements() {
         Queue<Integer> queue = new LinkedList<>();
         queue.add(1);
@@ -24,30 +23,33 @@ void testReverseMultipleElements() {
         assertEquals(1, queue.poll());
         assertTrue(queue.isEmpty());
     }
+
+    @Test
     void testReverseSingleElement() {
         Queue<Integer> queue = new LinkedList<>();
         queue.add(42);
         ReverseQueueRecursion.reverseQueue(queue);
-
         assertEquals(42, queue.poll());
         assertTrue(queue.isEmpty());
     }
+
+    @Test
     void testReverseEmptyQueue() {
         Queue<Integer> queue = new LinkedList<>();
         ReverseQueueRecursion.reverseQueue(queue);
         assertTrue(queue.isEmpty());
     }
+
+    @Test
     void testReverseStringQueue() {
         Queue<String> queue = new LinkedList<>();
         queue.add("A");
         queue.add("B");
         queue.add("C");
         ReverseQueueRecursion.reverseQueue(queue);
-
         assertEquals("C", queue.poll());
         assertEquals("B", queue.poll());
         assertEquals("A", queue.poll());
         assertTrue(queue.isEmpty());
     }
 }
-