Update Delete Node in LL

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 7 - Linked Lists I/Delete Node in LL

@@ -39,3 +39,54 @@ Sample Output 2 :
 4 5 2 6 1 9
 10 20 30 40 50 60
 */
+/*
+
+	Following is the Node class already written for the Linked List
+
+	class LinkedListNode<T> {
+    	T data;
+    	LinkedListNode<T> next;
+    
+    	public LinkedListNode(T data) {
+        	this.data = data;
+    	}
+	}
+
+*/
+
+public class Solution {
+
+	public static LinkedListNode<Integer> deleteNode(LinkedListNode<Integer> head, int pos) {
+		//Your code goes here
+        if (pos<0)
+        {
+            return head;
+        }
+            
+        else if(pos==0)
+        {
+            head=head.next;
+        }
+        else
+        {
+            LinkedListNode<Integer> n=head,delNode=null;
+            for (int i=0;i<pos-1 && n!=null;i++)
+            {
+                n=n.next;
+            }
+            if (n!=null && n.next!=null)
+            {
+                if (n.next!=null)
+                {
+                    n.next=n.next.next;
+                }
+                else
+                {
+                    n.next=null;
+                }
+                
+            }
+        }
+        return head;
+	}
+}