Question

Linked list is a type of data structure. Each item of the list holds a data and a pointer to the next item. Head is a pointer that points to the first element. Tail is the last element of the list, which points to "NULL". Linked list can be implemented using structures, consisting of some data types and a pointer. Write a program that creates the linked list given in the following figure and prints out the data in order. For this problem, you don't need to do any scanf. Follow the codes in article 12.8 and 12.9 of textbook and ch-12 slides of class. data next data next data next data next 10 head

Answer 1

//################################## PGM START ####################################

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

//structure with a integer value and next pointer
struct node{
   int value;
   struct node *next;
};
//function which cretes a newnode
struct node* create_node(int data){
   struct node* newnode=(struct node*) malloc(sizeof(struct node));
    newnode->value = data;
    newnode->next = NULL;
    return newnode;
}
//function to insert a data to list pointed by head
void insert(struct node **head,int data){
   struct node* n1=create_node(data);
   n1->next=*head;
   *head=n1;
}
//function to print values in list
void printLinkedList(struct node* head){
   while(head->next!=NULL){
       printf("%d --> ",head->value);
       head=head->next;
   }
   printf("%d\n",head->value);
}
//main method
int main(){
   //creatin a head pointer
   struct node* head=NULL;
   //inserting values to list
   insert(&head,1);
   insert(&head,2);
   insert(&head,10);
   insert(&head,3);
  
   //prinitng values in list
   printf("List elements\n");
   printLinkedList(head);
   return 0;
}

//################################# PGM END #######################################

OUTPUT
##########