Jul 18, 2025 · Jul 16, 2025 · Jul 18, 2025
diff --git a/src/test/java/com/thealgorithms/datastructures/lists/CountSinglyLinkedListRecursionTest.java b/src/test/java/com/thealgorithms/datastructures/lists/CountSinglyLinkedListRecursionTest.java
 list.insert(3);
 assertEquals(5,list.count(),"Count of a list with duplicate elements should match total node count.");
    }

 @Test
 publicvoidtestCountAfterClearingList() {
 for (inti =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
 publicvoidtestCountOnVeryLargeList() {
 intn =1000;
 for (inti =0;i <n;i++) {
 list.insert(i);
        }
 assertEquals(n,list.count(),"Count should correctly return for large list sizes.");
    }

 @Test
 publicvoidtestCountOnListWithNegativeNumbers() {
 list.insert(-1);
 list.insert(-5);
 list.insert(-10);
 assertEquals(3,list.count(),"Count should correctly handle negative values.");
    }

 @Test
 publicvoidtestCountIsConsistentWithoutModification() {
 list.insert(1);
 list.insert(2);
 intfirstCount =list.count();
 intsecondCount =list.count();
 assertEquals(firstCount,secondCount,"Repeated count calls should return consistent values.");
    }
 }
Original file line number	Diff line number	Diff line change
Expand Up		@@ -46,4 +46,39 @@ public void testCountWithDuplicateElements() {
		list.insert(3);
		assertEquals(5,list.count(),"Count of a list with duplicate elements should match total node count.");
		}

		@Test
		publicvoidtestCountAfterClearingList() {
		for (inti =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
		publicvoidtestCountOnVeryLargeList() {
		intn =1000;
		for (inti =0;i <n;i++) {
		list.insert(i);
		}
		assertEquals(n,list.count(),"Count should correctly return for large list sizes.");
		}

		@Test
		publicvoidtestCountOnListWithNegativeNumbers() {
		list.insert(-1);
		list.insert(-5);
		list.insert(-10);
		assertEquals(3,list.count(),"Count should correctly handle negative values.");
		}

		@Test
		publicvoidtestCountIsConsistentWithoutModification() {
		list.insert(1);
		list.insert(2);
		intfirstCount =list.count();
		intsecondCount =list.count();
		assertEquals(firstCount,secondCount,"Repeated count calls should return consistent values.");
		}
		}