1+ package com .thealgorithms .datastructures .lists ;
2+
13import static org .junit .jupiter .api .Assertions .*;
24import org .junit .jupiter .api .Test ;
35
@@ -6,23 +8,23 @@ public class MiddleOfLinkedListTest {
68 @ Test
79 void testMiddleNodeOddLength () {
810 MiddleOfLinkedList sol = new MiddleOfLinkedList ();
9- int [] values = {1 , 2 , 3 , 4 , 5 }; // Odd-length list
11+ int [] values = {1 , 2 , 3 , 4 , 5 };
1012 ListNode head = MiddleOfLinkedList .createList (values );
1113
1214 ListNode middle = sol .middleNode (head );
1315
14- assertEquals (3 , middle .val ); // Expect middle to be 3
16+ assertEquals (3 , middle .val );
1517 }
1618
1719 @ Test
1820 void testMiddleNodeEvenLength () {
1921 MiddleOfLinkedList sol = new MiddleOfLinkedList ();
20- int [] values = {1 , 2 , 3 , 4 , 5 , 6 }; // Even-length list
22+ int [] values = {1 , 2 , 3 , 4 , 5 , 6 };
2123 ListNode head = MiddleOfLinkedList .createList (values );
2224
2325 ListNode middle = sol .middleNode (head );
2426
25- assertEquals (4 , middle .val ); // Expect middle to be 4 (second middle)
27+ assertEquals (4 , middle .val );
2628 }
2729
2830 @ Test
@@ -33,7 +35,7 @@ void testMiddleNodeSingleElement() {
3335
3436 ListNode middle = sol .middleNode (head );
3537
36- assertEquals (1 , middle .val ); // Expect middle to be 1
38+ assertEquals (1 , middle .val );
3739 }
3840
3941 @ Test
@@ -44,6 +46,6 @@ void testMiddleNodeEmptyList() {
4446
4547 ListNode middle = sol .middleNode (head );
4648
47- assertNull (middle ); // Expect null for empty list
49+ assertNull (middle );
4850 }
4951}
0 commit comments