Notes

Write a note in this area. It's really #include <stdio.h>

#include <stdlib.h>
//represent a node of singly linked list
struct node{
int data;
struct node *next;

};
//represent the head and tail of the singly linked list
struct node*head,*tail=NULL;
//addnode()will add a new node to the list
void addNode(int data){
//create a new node
struct node*newNode=(struct node*)malloc(sizeof(struct node));
newNode->data=data;
newNode->next=NULL;
//check if the list is empty
if(head==NULL){
//if list is empty both head and tail will point to a new node
head=newNode;
tail=newNode;
}
else{
tail->next=newNode;
tail=newNode;
}

}
void display(){
struct node *current=head;
if(head==NULL){
printf("list is emptyn");
return;
}
printf("nodes of singly linked list:n");
while(current !=NULL){
printf("%d",current->data);
current=current->next;

}
printf("n");
}
int main()
{
addNode(1);
addNode(2);
addNode(3);
addNode(4);
display();
return 0;
}
easy to share with others. Click here ...