forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathReverseQueueRecursionTest.java
More file actions
54 lines (48 loc) · 1.53 KB
/
ReverseQueueRecursionTest.java
File metadata and controls
54 lines (48 loc) · 1.53 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
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);
queue.add(2);
queue.add(3);
queue.add(4);
ReverseQueueRecursion.reverseQueue(queue);
assertEquals(4, queue.poll());
assertEquals(3, queue.poll());
assertEquals(2, queue.poll());
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());
}
}