Single Linked List – Insert, Delete and Print

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
int sd;
struct Node *next;
}node;

void insere(node ** head, int sd){
node ** ptr2=head;
if(*ptr2==NULL){
(*ptr2)=(node*)malloc(sizeof(node));
(*ptr2)->sd=sd;
(*ptr2)->next=NULL;
}else{
while(*ptr2 != NULL){
ptr2 = &(*ptr2)->next;
}
(*ptr2)=(node*)malloc(sizeof(node));
(*ptr2)->sd=sd;
(*ptr2)->next=NULL;
}
}

void remove(node ** head,int sd){
node ** ptr2;
for(ptr2= head; *ptr2 != NULL; ptr2 = &(*ptr2)->next)
{
if((*ptr2)->sd == sd)
{
*ptr2 = (*ptr2)->next;
break;
}
}
}

void printLista (node * head) {
printf(“Lista: “);
node * ptr =head;
while(ptr!=NULL){
printf(“%d “, ptr->sd);
ptr=ptr->next;
}
printf(“\n”);
}

Tags: Single Linked List Add Remove C Language