Delete a Component from a Linked List, use malloc() to create the components of list - C Data Structure

C examples for Data Structure:Linked List

  1. HOME
  2. C
  3. Data Structure
  4. Linked List

Description

Delete a Component from a Linked List, use malloc() to create the components of list

Demo Code

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

struct members {//from   w  w  w . j  a  v  a2s .c o  m
      char name[20];
      struct members *next;
};

typedef struct members node;

void display(node *start);
int main()
{
      node *start, *temp = NULL;
    
      start = (node *) malloc(sizeof(node));
      strcpy(start->name, "lina");
      start->next = (node *) malloc(sizeof(node));
      strcpy(start->next->name, "mina");
      start->next->next = (node *) malloc(sizeof(node));
      strcpy(start->next->next->name, "bina");
      start->next->next->next = (node *) malloc(sizeof(node));
      strcpy(start->next->next->next->name, "tina");
      start->next->next->next->next = NULL;
    
      printf("Names of all the members:\n");
      display(start);
    
      printf("\nDeleting first component - lina\n");
      temp = start->next;
      free(start);
      start = temp;
      temp = NULL;
      display(start);
    
      printf("\nDeleting non-first component - bina\n");
      temp = start->next->next;
      free(start->next);
      start->next = temp;
      temp = NULL;
      display(start);
    
      return(0);
}

void display(node *start)
{
     int flag = 1;
    
     do {
           printf("%s\n", start->name);
           if(start->next == NULL)
                 flag = 0;
           start = start->next;
     } while (flag);
    
     return;
}

Result


Related Tutorials