/*
Input Format 
You have to complete the Node* Insert(Node* head, int data, int position) method which takes three arguments - the head of the linked list, the integer to insert and the position at which the integer must be inserted. You should NOT read any input from stdin/console. position will always be between 0 and the number of the elements in the list (inclusive).

Output Format 
Insert the new node at the desired position and return the head of the updated linked list. Do NOT print anything to stdout/console.

Sample Input

NULL, data = 3, position = 0 
3 --> NULL, data = 4, position = 0

Sample Output

3 --> NULL
4 --> 3 --> NULL
Explanation 
1. we have an empty list and position 0. 3 becomes head. 
2. 4 is added to position 0, hence 4 becomes head.

Note 
For the purpose of evaluation the list has been initialised with a node with data=2. Ignore it, this is done to avoid printing empty lists while comparing output.


*/

/*
  Insert Node at a given position in a linked list 
  head can be NULL 
  First element in the linked list is at position 0
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
Node* InsertNth(Node *head, int data, int position)
{
    Node* temp = (Node*)malloc(sizeof(Node));
    temp->data = data;
    temp->next=NULL;
    
    Node* prev;  
    prev = head;
    if(position == 0){
        temp->next=head;
        head=temp;
    }
    else{
        for(int i =0; i< position-1; i++){
            if(prev->next!=NULL)
            prev = prev->next;
        }
        
        temp->next = prev->next;
        prev->next = temp;
    }
    return head;
}

Add insert node at nth position
Add insert node at nth position
