@@ -0,0 +1,742 @@
+/*%0A  Insert Node at the end of a linked list%0A  head pointer input could be NULL as well for empty list%0A  Node is defined as%0A  class Node %7B%0A     int data;%0A     Node next;%0A  %7D%0A*/%0A    // This is a %22method-only%22 submission.%0A    // You only need to complete this method.%0A%0ANode InsertNth(Node head, int data, int position) %7B%0A%0A    // Create new node%0A    Node temp = new Node();%0A    temp.data = data;%0A%0A%0A    // Insert at head%0A    if (position == 0) %7B%0A      temp.next = head;%0A      return temp;%0A    %7D%0A%0A    // Iterate through list to find node prior to insert point%0A    Node curr = head;%0A    for (int i = 0; i %3C position - 1; i++)%7B%0A        curr = curr.next;%0A    %7D%0A%0A    // Insert node%0A    temp.next = curr.next;%0A    curr.next = temp;%0A%0A    return head;%0A%7D%0A

solve insert a node at specific position