|
1 | 1 | package com.thealgorithms.datastructures.queues; |
2 | | - |
3 | 2 | import static org.junit.jupiter.api.Assertions.assertEquals; |
4 | 3 | import static org.junit.jupiter.api.Assertions.assertTrue; |
5 | 4 | import java.util.LinkedList; |
6 | 5 | import java.util.Queue; |
7 | 6 | import org.junit.jupiter.api.Test; |
8 | | - |
9 | 7 | class ReverseQueueRecursionTest { |
10 | | - |
11 | | - @Test |
12 | 8 | void testReverseMultipleElements() { |
13 | 9 | Queue<Integer> queue = new LinkedList<>(); |
14 | 10 | queue.add(1); |
15 | 11 | queue.add(2); |
16 | 12 | queue.add(3); |
17 | 13 | queue.add(4); |
18 | | - |
19 | 14 | ReverseQueueRecursion.reverseQueue(queue); |
20 | | - |
21 | 15 | assertEquals(4, queue.poll()); |
22 | 16 | assertEquals(3, queue.poll()); |
23 | 17 | assertEquals(2, queue.poll()); |
24 | 18 | assertEquals(1, queue.poll()); |
25 | 19 | assertTrue(queue.isEmpty()); |
26 | 20 | } |
27 | | - |
28 | | - @Test |
29 | 21 | void testReverseSingleElement() { |
30 | 22 | Queue<Integer> queue = new LinkedList<>(); |
31 | 23 | queue.add(42); |
32 | | - |
33 | 24 | ReverseQueueRecursion.reverseQueue(queue); |
34 | 25 |
|
35 | 26 | assertEquals(42, queue.poll()); |
36 | 27 | assertTrue(queue.isEmpty()); |
37 | 28 | } |
38 | | - |
39 | | - @Test |
40 | 29 | void testReverseEmptyQueue() { |
41 | 30 | Queue<Integer> queue = new LinkedList<>(); |
42 | | - |
43 | 31 | ReverseQueueRecursion.reverseQueue(queue); |
44 | | - |
45 | 32 | assertTrue(queue.isEmpty()); |
46 | 33 | } |
47 | | - |
48 | | - @Test |
49 | 34 | void testReverseStringQueue() { |
50 | 35 | Queue<String> queue = new LinkedList<>(); |
51 | 36 | queue.add("A"); |
52 | 37 | queue.add("B"); |
53 | 38 | queue.add("C"); |
54 | | - |
55 | 39 | ReverseQueueRecursion.reverseQueue(queue); |
56 | 40 |
|
57 | 41 | assertEquals("C", queue.poll()); |
|
0 commit comments