Nodeafternode

// Case 4
struct Node * insertAfterNode(struct Node *head, struct Node *prevNode, int data){
    struct Node * ptr = (struct Node *) malloc(sizeof(struct Node));
    ptr->data = data;
 
    ptr->next = prevNode->next;
    prevNode->next = ptr;
 
    return head;
}

Source: codewithharry.com

Similar codes

0 vote334 views1 answer
The amount of input is unknown
C++
4 votes365 views2 answers
How to hide the console c++
C++
0 vote317 views1 answer
Even and odd sum in c++
C++
0 vote330 views1 answer
Char vector to string c++
C++
0 vote328 views1 answer
Store array in vector
C++
11 votes342 views3 answers
C++ map iterator
C++
0 vote377 views1 answer
Remove item from layout
C++
0 vote337 views1 answer
Accpt array input in single line in cpp
C++
2 votes290 views1 answer
First missing integer leetcode
C++
0 vote351 views2 answers
Comment savoir si un nombre est premier c++
C++