Codacy issue resolution and added test cases for codecov

Author: mohit-gogitter

DataStructures.Tests/LinkedList/CircularLinkedListTests.cs

@@ -7,6 +7,17 @@ namespace DataStructures.Tests.LinkedList;
 [TestFixture]
 public static class CircularLinkedListTests
 {
+    [Test]
+    public static void TestDisplay()
+    {
+        var cll = new CircularLinkedList<int>();
+        cll.InsertAtEnd(10);
+        cll.InsertAtEnd(20);
+        cll.InsertAtEnd(30);
+
+        Assert.That("10 20 30", Is.EqualTo(GetDisplayOutput(cll).Trim()));
+    }
+
     [Test]
     public static void TestInsertAtBeginning()
     {
@@ -42,51 +53,53 @@ public static void TestInsertAfter()
     }
 
     [Test]
-    public static void TestDeleteNode()
+    public static void TestInsertAtBeginningInEmptyList()
     {
         var cll = new CircularLinkedList<int>();
-        cll.InsertAtEnd(10);
-        cll.InsertAtEnd(20);
-        cll.InsertAtEnd(30);
-
-        cll.DeleteNode(20);
-        Assert.That("10 30", Is.EqualTo(GetDisplayOutput(cll).Trim()));
+        cll.InsertAtBeginning(10);
+        Assert.That("10", Is.EqualTo(GetDisplayOutput(cll).Trim()));
     }
 
     [Test]
-    public static void TestDisplay()
+    public static void TestInsertAtEndInEmptyList()
     {
         var cll = new CircularLinkedList<int>();
         cll.InsertAtEnd(10);
-        cll.InsertAtEnd(20);
-        cll.InsertAtEnd(30);
 
-        Assert.That("10 20 30", Is.EqualTo(GetDisplayOutput(cll).Trim()));
+        Assert.That("10", Is.EqualTo(GetDisplayOutput(cll).Trim()));
     }
 
     [Test]
-    public static void TestDeleteFromEmptyList()
+    public static void TestInsertAfterSpecificNode()
     {
         var cll = new CircularLinkedList<int>();
-        cll.DeleteNode(10);
-        Assert.That(cll.IsEmpty(), Is.EqualTo(true));
+        cll.InsertAtEnd(10);
+        cll.InsertAtEnd(20);
+        cll.InsertAtEnd(30);
+
+        cll.InsertAfter(20, 25); // Insert after node with value 20
+        Assert.That("10 20 25 30", Is.EqualTo(GetDisplayOutput(cll).Trim()));
     }
 
     [Test]
-    public static void TestInsertInEmptyList()
+    public static void TestInsertAfterOnNonExistingValue()
     {
         var cll = new CircularLinkedList<int>();
-        cll.InsertAtBeginning(10);
+        cll.InsertAtEnd(10);
+        cll.InsertAfter(99, 25); // 99 does not exist
         Assert.That("10", Is.EqualTo(GetDisplayOutput(cll).Trim()));
     }
 
     [Test]
-    public static void TestInsertAfterOnNonExistingValue()
+    public static void TestDeleteNode()
     {
         var cll = new CircularLinkedList<int>();
         cll.InsertAtEnd(10);
-        cll.InsertAfter(99, 25); // 99 does not exist
-        Assert.That("10", Is.EqualTo(GetDisplayOutput(cll).Trim()));
+        cll.InsertAtEnd(20);
+        cll.InsertAtEnd(30);
+
+        cll.DeleteNode(20);
+        Assert.That("10 30", Is.EqualTo(GetDisplayOutput(cll).Trim()));
     }
 
     [Test]
@@ -120,6 +133,26 @@ public static void TestDeleteTailNode()
         Assert.That("10 20", Is.EqualTo(GetDisplayOutput(cll).Trim()));
     }
 
+    [Test]
+    public static void TestDeleteFromEmptyList()
+    {
+        var cll = new CircularLinkedList<int>();
+        cll.DeleteNode(10);
+        Assert.That(cll.IsEmpty(), Is.EqualTo(true));
+    }
+
+    [Test]
+    public static void TestDeleteNonExistentNode()
+    {
+        var cll = new CircularLinkedList<int>();
+        cll.InsertAtEnd(10);
+        cll.InsertAtEnd(20);
+        cll.InsertAtEnd(30);
+
+        cll.DeleteNode(40); // Attempting to delete a node that doesn't exist
+        Assert.That("10 20 30", Is.EqualTo(GetDisplayOutput(cll).Trim()));
+    }
+
     /// <summary>
     /// Helper method to capture the output of the Display method for assertions.
     /// </summary>

DataStructures/LinkedList/CircularLinkedList/CircularLinkedListNode.cs

@@ -19,6 +19,6 @@ public class CircularLinkedListNode<T>(T data)
         /// <summary>
         /// Gets or sets the reference to the next node in the list.
         /// </summary>
-        public CircularLinkedListNode<T>? Next { get; set; } = null;
+        public CircularLinkedListNode<T>? Next { get; set; }
     }
 }