@@ -89,13 +89,13 @@ void testMoveLastElementToFrontPreservesFullListStructure() {
8989 list .insert (30 );
9090
9191 // Search tail element '30'
92- assertTrue (list .search (30 ));// Order becomes [30, 10, 20]
92+ assertTrue (list .search (30 )); // Order becomes [30, 10, 20]
9393
94- assertEquals (30 , list .getHeadValue ());
95- assertEquals (3 , list .getSize ());
94+ assertEquals (30 , list .getHeadValue ());
95+ assertEquals (3 , list .getSize ());
9696
9797 // Verify remaining chain order [10, 20]
98- assertTrue (list .search (20 ));// [20, 30, 10]
98+ assertTrue (list .search (20 )); // [20, 30, 10]
9999 assertEquals (20 , list .getHeadValue ());
100100
101101 assertTrue (list .search (10 )); // [10, 20, 30]
@@ -118,7 +118,7 @@ void testSearchNonExistentElementPreservesStructureAndSize() {
118118 void testDuplicateValuesMovesFirstMatchedToFront () {
119119 list .insert (10 );
120120 list .insert (20 );
121- list .insert (10 );// Duplicate '10' at tail
121+ list .insert (10 ); // Duplicate '10' at tail
122122 list .insert (30 );
123123
124124 // Initial list state: [10, 20, 10, 30]
0 commit comments