algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

testing: additional testcases for CountSinglyLinkedListRecursionTest (#6392)

Browse Source 
testing: additional testcases for CountSinglyLinkedListRecursionTest

Co-authored-by: Deniz Altunkapan <93663085+DenizAltunkapan@users.noreply.github.com>
This commit is contained in:
Oleksandr Klymenko
2025-07-18 08:51:11 +03:00
committed by GitHub
parent 2f2a32b8c2
commit d0d4b3c8fb
1 changed files with 35 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
src/test/java/com/thealgorithms/datastructures/lists/CountSinglyLinkedListRecursionTest.java
View File

@@ -46,4 +46,39 @@ public class CountSinglyLinkedListRecursionTest {
list.insert(3);
assertEquals(5, list.count(), "Count of a list with duplicate elements should match total node count.");
}
@Test
public void testCountAfterClearingList() {
for (int i = 1; i <= 4; i++) {
list.insert(i);
}
list.clear(); // assuming you have a clear method; if not, skip this
assertEquals(0, list.count(), "Count after clearing the list should be 0.");
}
@Test
public void testCountOnVeryLargeList() {
int n = 1000;
for (int i = 0; i < n; i++) {
list.insert(i);
}
assertEquals(n, list.count(), "Count should correctly return for large list sizes.");
}
@Test
public void testCountOnListWithNegativeNumbers() {
list.insert(-1);
list.insert(-5);
list.insert(-10);
assertEquals(3, list.count(), "Count should correctly handle negative values.");
}
@Test
public void testCountIsConsistentWithoutModification() {
list.insert(1);
list.insert(2);
int firstCount = list.count();
int secondCount = list.count();
assertEquals(firstCount, secondCount, "Repeated count calls should return consistent values.");
}
}