Unneccasry checks are removed

Akshith121 · Akshith121 · commit d4dec50535ec · 2023-04-12T12:36:56.000+05:30
diff --git a/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java b/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java
@@ -123,21 +123,14 @@ public void swapNodes(int valueFirst, int valueSecond) {
      *
      */
     public Node reverseList(Node node) {
-        //When node is null, then "next" will cause an error as we are accesing node.next, which will give a NullPointer Exception
-        if(node==null){
-            return node;
-        }
         Node prev = null;
         Node curr = node;
-        Node next=curr.next;
+        
         while (curr != null) {
+            Node next=curr.next;
             curr.next = prev;
             prev = curr;
             curr = next;
-            //NullPointer Exception is handled here for next variable inside while loop
-            if(next!=null){
-                next = next.next;
-            }
         }
         //prev will be pointing to the last element in the Linkedlist, it will be the new head of the reversed linkedlist
         return prev;
