Update Delete Node Recursively

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 8 - Linked Lists II/Delete Node Recursively

@@ -37,3 +37,41 @@ Sample Input 2 :
 Sample Output 2 :
 10 20 30 50 
 */
+/*
+
+    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> deleteNodeRec(LinkedListNode<Integer> head, int pos) {
+    	//Your code goes here
+		if (head == null)
+        {
+            return head;
+        }
+        
+        if (pos==0)
+        {
+            head=head.next;
+            return head;
+        }
+        else
+        {
+            LinkedListNode<Integer> smallerHead=deleteNodeRec(head.next,pos-1);
+            head.next=smallerHead;
+            return head;
+        }  
+	}
+
+}