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

-1 vote187 views1 answer
#include using namespace std; int main() { double leashamt,collaramt,foodamt,totamt; cout<<"Enter the amount spent for a leash : ";
C++
1 vote138 views1 answer
Binary exponentiation
C++
2 votes132 views1 answer
Clear buffer memory in c / c++
C++
0 vote163 views1 answer
Vector of strings initialization c++
C++
0 vote135 views1 answer
How to use comparitor in priority queu in c++
C++
2 votes142 views1 answer
Recursive binary search
C++
0 vote150 views1 answer
Log base 2 in c++
C++
0 vote136 views1 answer
C++ thread incide class
C++
2 votes116 views1 answer
Check compiler version c++
C++
0 vote135 views1 answer
If(arr[i]==k) return arr[i];
C++