Data Structures Single Linked List C Program

Data Structures Lab Manual / Data Structures Single Linked List C Program

Program Name: Write a C Program for Single Linked List in Data Structures

Theory

A Single Linked List is a linear data structure and has two parts data section and address section
( holds the address of the next element in the list, which is called a node.).  it can be 
traversed in only one direction from head to the last node (tail).

Program Code

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

struct node 
{
int value;
struct node *next;
};

void insert();
void display();
void delete();
int count();

typedef struct node DATA_NODE;

DATA_NODE *head_node, *first_node, *temp_node = 0, *prev_node, next_node;
int data;

void main() 
{
int choice = 0;
printf("Single Linked List Operations\n");

while (choice < 5) 
{

printf("Enter a Choice to perform the Operation\n");
printf("1.Insert   2. Delete   3. Display   4.Exit\n");
scanf("%d", &choice);

switch (choice) 
{
case 1: insert(); break;
case 2: delete(); break;
case 3: display(); break;
case 4: count(); break;
default: break;
}
}
}

void insert() 
{
printf("\nEnter Element for Insert Linked List : \n");
scanf("%d", &data);

temp_node = (DATA_NODE *) malloc(sizeof (DATA_NODE));
temp_node->value = data;


if (first_node == 0) 
first_node = temp_node;
else 
head_node->next = temp_node;


temp_node->next = 0;
head_node = temp_node;
fflush(stdin);
}



void delete() 
{
int countvalue, position, i = 0;
countvalue = count();
temp_node = first_node;
printf("\nDisplay Linked List");

printf("\nEnter Position for Delete Element: ");
scanf("%d", &position);

if (position > 0 && position <= countvalue) 
{
if (position == 1) 
{
temp_node = temp_node -> next;
first_node = temp_node;
printf("\nDeleted Successfully \n\n");
} 
else 
{
      while (temp_node != 0) 
	{
        if (i == (position - 1)) {
          prev_node->next = temp_node->next;
          if(i == (countvalue - 1))
          {
			  head_node = prev_node;
		  }
          printf("\nDeleted Successfully \n\n");
          break;
        } else {
          i++;
          prev_node = temp_node;
          temp_node = temp_node -> next;
        }
      }
    }
  } else
    printf("\nInvalid Position \n\n");
}




void display() 
{
int count = 0;
temp_node = first_node;
printf("\nDisplay Single Linked List : \n");
while (temp_node != 0) 
{
printf("# %d # ", temp_node->value);
count++;
temp_node = temp_node -> next;
}
printf("\nSingle Linked List No Of Items : %d\n", count);
}

int count() 
{
int count = 0;
temp_node = first_node;
while (temp_node != 0) 
{
count++;
temp_node = temp_node -> next;
}
printf("\nSingle Linked List No Of Items  : %d\n", count);
return count;
}

Input:
Single Linked List Operations
Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
1

Enter Element for Insert Linked List : 
9

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
1

Enter Element for Insert Linked List : 
6

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
1

Enter Element for Insert Linked List : 
3

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
3

Display Single Linked List : 
# 9 # # 6 # # 3 # 

Single Linked List No Of Items : 3
Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
2

Single Linked List No Of Items  : 3

Display Linked List
Enter Position for Delete Element: 2

Deleted Successfully 

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
3

Display Single Linked List : 
# 9 # # 3 # 

Single Linked List No Of Items : 2
Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit

Output:
Single Linked List Operations
Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
1

Enter Element for Insert Linked List : 
9

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
1

Enter Element for Insert Linked List : 
6

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
1

Enter Element for Insert Linked List : 
3

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
3

Display Single Linked List : 
# 9 # # 6 # # 3 # 

Single Linked List No Of Items : 3
Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
2

Single Linked List No Of Items  : 3

Display Linked List
Enter Position for Delete Element: 2

Deleted Successfully 

Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit
3

Display Single Linked List : 
# 9 # # 3 # 

Single Linked List No Of Items : 2
Enter a Choice to perform the Operation
1.Insert   2. Delete   3. Display   4.Exit

Home Back