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 vote332 views1 answer
SPEED c++
C++
0 vote315 views1 answer
Semi colon in argument list c++
C++
3 votes305 views1 answer
Deque c++
C++
-1 vote334 views1 answer
How to define range of numbers inside a if condition in c++
C++
10 votes294 views2 answers
Last index of string c++
C++
0 vote323 views1 answer
Cout alternative c++
C++
0 vote331 views1 answer
Check whether kth bit is 1
C++
0 vote303 views1 answer
How to fill vector from inputs c++
C++
9 votes319 views2 answers
Delete last char of string C++
C++
0 vote348 views1 answer
C++ switch integer
C++