From f6c9f86562f54ddc20d416f217bc0f531a732113 Mon Sep 17 00:00:00 2001 From: AYAZ2006 Date: Sun, 5 Oct 2025 18:55:04 +0530 Subject: [PATCH 1/4] Create MiddleOfLinkedListTest.java --- .../lists/MiddleOfLinkedListTest.java | 49 +++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java diff --git a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java new file mode 100644 index 000000000000..064d8ba07551 --- /dev/null +++ b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java @@ -0,0 +1,49 @@ +import static org.junit.jupiter.api.Assertions.*; +import org.junit.jupiter.api.Test; + +public class MiddleOfLinkedListTest { + + @Test + void testMiddleNodeOddLength() { + MiddleOfLinkedList sol = new MiddleOfLinkedList(); + int[] values = {1, 2, 3, 4, 5}; // Odd-length list + ListNode head = MiddleOfLinkedList.createList(values); + + ListNode middle = sol.middleNode(head); + + assertEquals(3, middle.val); // Expect middle to be 3 + } + + @Test + void testMiddleNodeEvenLength() { + MiddleOfLinkedList sol = new MiddleOfLinkedList(); + int[] values = {1, 2, 3, 4, 5, 6}; // Even-length list + ListNode head = MiddleOfLinkedList.createList(values); + + ListNode middle = sol.middleNode(head); + + assertEquals(4, middle.val); // Expect middle to be 4 (second middle) + } + + @Test + void testMiddleNodeSingleElement() { + MiddleOfLinkedList sol = new MiddleOfLinkedList(); + int[] values = {1}; + ListNode head = MiddleOfLinkedList.createList(values); + + ListNode middle = sol.middleNode(head); + + assertEquals(1, middle.val); // Expect middle to be 1 + } + + @Test + void testMiddleNodeEmptyList() { + MiddleOfLinkedList sol = new MiddleOfLinkedList(); + int[] values = {}; + ListNode head = MiddleOfLinkedList.createList(values); + + ListNode middle = sol.middleNode(head); + + assertNull(middle); // Expect null for empty list + } +} From 6bd873a489503e205a3cf5369ce6053cfa992213 Mon Sep 17 00:00:00 2001 From: AYAZ2006 Date: Sun, 5 Oct 2025 19:04:08 +0530 Subject: [PATCH 2/4] Update MiddleOfLinkedListTest.java --- .../lists/MiddleOfLinkedListTest.java | 14 ++++++++------ 1 file changed, 8 insertions(+), 6 deletions(-) diff --git a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java index 064d8ba07551..466d82ff43d7 100644 --- a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java +++ b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java @@ -1,3 +1,5 @@ +package com.thealgorithms.datastructures.lists; + import static org.junit.jupiter.api.Assertions.*; import org.junit.jupiter.api.Test; @@ -6,23 +8,23 @@ public class MiddleOfLinkedListTest { @Test void testMiddleNodeOddLength() { MiddleOfLinkedList sol = new MiddleOfLinkedList(); - int[] values = {1, 2, 3, 4, 5}; // Odd-length list + int[] values = {1, 2, 3, 4, 5}; ListNode head = MiddleOfLinkedList.createList(values); ListNode middle = sol.middleNode(head); - assertEquals(3, middle.val); // Expect middle to be 3 + assertEquals(3, middle.val); } @Test void testMiddleNodeEvenLength() { MiddleOfLinkedList sol = new MiddleOfLinkedList(); - int[] values = {1, 2, 3, 4, 5, 6}; // Even-length list + int[] values = {1, 2, 3, 4, 5, 6}; ListNode head = MiddleOfLinkedList.createList(values); ListNode middle = sol.middleNode(head); - assertEquals(4, middle.val); // Expect middle to be 4 (second middle) + assertEquals(4, middle.val); } @Test @@ -33,7 +35,7 @@ void testMiddleNodeSingleElement() { ListNode middle = sol.middleNode(head); - assertEquals(1, middle.val); // Expect middle to be 1 + assertEquals(1, middle.val); } @Test @@ -44,6 +46,6 @@ void testMiddleNodeEmptyList() { ListNode middle = sol.middleNode(head); - assertNull(middle); // Expect null for empty list + assertNull(middle); } } From 89424c13ccdb13851c31849505d1abaa9bd60a8d Mon Sep 17 00:00:00 2001 From: AYAZ2006 Date: Sun, 5 Oct 2025 19:15:47 +0530 Subject: [PATCH 3/4] Update MiddleOfLinkedListTest.java --- .../lists/MiddleOfLinkedListTest.java | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) diff --git a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java index 466d82ff43d7..ab9695b69c31 100644 --- a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java +++ b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java @@ -1,6 +1,7 @@ package com.thealgorithms.datastructures.lists; import static org.junit.jupiter.api.Assertions.*; + import org.junit.jupiter.api.Test; public class MiddleOfLinkedListTest { @@ -9,9 +10,9 @@ public class MiddleOfLinkedListTest { void testMiddleNodeOddLength() { MiddleOfLinkedList sol = new MiddleOfLinkedList(); int[] values = {1, 2, 3, 4, 5}; - ListNode head = MiddleOfLinkedList.createList(values); + MiddleOfLinkedList.ListNode head = MiddleOfLinkedList.createList(values); - ListNode middle = sol.middleNode(head); + MiddleOfLinkedList.ListNode middle = sol.middleNode(head); assertEquals(3, middle.val); } @@ -20,9 +21,9 @@ void testMiddleNodeOddLength() { void testMiddleNodeEvenLength() { MiddleOfLinkedList sol = new MiddleOfLinkedList(); int[] values = {1, 2, 3, 4, 5, 6}; - ListNode head = MiddleOfLinkedList.createList(values); + MiddleOfLinkedList.ListNode head = MiddleOfLinkedList.createList(values); - ListNode middle = sol.middleNode(head); + MiddleOfLinkedList.ListNode middle = sol.middleNode(head); assertEquals(4, middle.val); } @@ -31,9 +32,9 @@ void testMiddleNodeEvenLength() { void testMiddleNodeSingleElement() { MiddleOfLinkedList sol = new MiddleOfLinkedList(); int[] values = {1}; - ListNode head = MiddleOfLinkedList.createList(values); + MiddleOfLinkedList.ListNode head = MiddleOfLinkedList.createList(values); - ListNode middle = sol.middleNode(head); + MiddleOfLinkedList.ListNode middle = sol.middleNode(head); assertEquals(1, middle.val); } @@ -42,7 +43,7 @@ void testMiddleNodeSingleElement() { void testMiddleNodeEmptyList() { MiddleOfLinkedList sol = new MiddleOfLinkedList(); int[] values = {}; - ListNode head = MiddleOfLinkedList.createList(values); + MiddleOfLinkedList.ListNode head = MiddleOfLinkedList.createList(values); ListNode middle = sol.middleNode(head); From 619c40af369626010b5185530a4225f714ce07b9 Mon Sep 17 00:00:00 2001 From: AYAZ2006 Date: Sun, 5 Oct 2025 19:18:54 +0530 Subject: [PATCH 4/4] Update MiddleOfLinkedListTest.java --- .../datastructures/lists/MiddleOfLinkedListTest.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java index ab9695b69c31..70df1106e8a1 100644 --- a/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java +++ b/src/test/java/com/thealgorithms/datastructures/lists/MiddleOfLinkedListTest.java @@ -45,7 +45,7 @@ void testMiddleNodeEmptyList() { int[] values = {}; MiddleOfLinkedList.ListNode head = MiddleOfLinkedList.createList(values); - ListNode middle = sol.middleNode(head); + MiddleOfLinkedList.ListNode middle = sol.middleNode(head); assertNull(middle); }