#include <stdlib.h>
#include <stdio.h>
struct node {
int value;
struct node* next;
};
typedef struct node node_t;
void print_list(node_t *head) {
node_t *temp = head;
while(temp -> next != NULL) {
printf("%d -> ", temp->value);
temp = temp->next;
}
printf("%d ", temp->value);
printf("\n");
}
node_t* create_new_node(int value) {
node_t *temp;
temp = malloc(sizeof(node_t));
temp -> value = value;
return temp;
}
void insert_after_node(node_t *tmp, node_t *newnode) {
newnode -> next = tmp -> next;
tmp -> next = newnode;
} …
Run Code Online (Sandbox Code Playgroud)