Question

Please slove all these questions in C language

Write a function insert At Position N () for a singly-linked list that has the following declaration and precondition: int insert At Position N (strict node **p Head, int n, int new Data); Precondition: n > 0 and the list always has enough nodes to satisfy the position specified by n. The function should allocate memory for a new node, and initialize it with the new Data value. It should then insert the node at the nth position in the list. The first node in the list starts at position you may NOT assume that a make Node () function exists. The function should return 1 if a new node was created; 0 otherwise. Assume that strict node is defined as follows: strict node int data; strict node *pNext;

Answer 1

struct Node
  {
     int data;
     struct Node *pNext;
  }

int insertPositionN(struct node **pHead, int n, int newData)
{

beginning
{
    // node which is going to be inserted at any given position
    Node *newNode;

    // 
    newNode = new Node;

    // Filing the new data in node
    newNode -> data = data;
    newNode -> next = NULL;

    // Might be the first node in the list
    if(head == NULL) {

        //Head will be the address of the new node
        return (head = newNode);
    } 
    
    // May be inserted at first
    else if(position == 0) {
        // after new node the existing linked list will be attached
        newNode -> next = head;

       // Now head will be the address of the new node
        return (head = NewNode);
    } 

    // Insertion at any nth position
    else {
       
        int DistFromHead = 1;
      
        Node *traverse = head;
      
        // Traversing to insert at Nth position
        while(traverse != NULL) {

            if(DistFromHead == position) {

                // Pointing ToBeInserted to the next node of Traverse
                newNode-> next = traverse -> next;

                // Now pointing traverse towards our New Node
                traverse -> next = newNode;

                // Returning Head as soon as we have inserted our new node
                return head;
            }
            traverse = traverse -> next;
            DistFromHead++;
        }
    }
}

if you like this answer, please give a thumbs up and if you have some doubt just ask in the comment section below. I will try to help. Cheers