#include #include struct node { int info; struct node *next; }; struct node *insert_new_element(struct node *p,int i) { struct node *q; q=(struct node *) malloc(sizeof(struct node)); q-> next = p; q-> info = i; return (q); } struct node *delete_one_element(struct node *p,int *i) { struct node *q; *i = p->info; q= p ->next; free (p); return (q); } //nn so la risposta