Scribd
Upload
35 views

DLL Program

This C program implements a doubly linked list to store employee data such as social security number, name, department, designation, salary, and phone number. Functions are defined to insert nodes at the beginning or end of the list, delete nodes from the beginning or end, and display the list. The main function contains a menu to call these functions and continuously operate on the linked list until the user exits.

Uploaded by

Ashish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

DLL Program

This C program implements a doubly linked list to store employee data such as social security number, name, department, designation, salary, and phone number. Functions are defined to insert nodes at the beginning or end of the list, delete nodes from the beginning or end, and display the list. The main function contains a menu to call these functions and continuously operate on the linked list until the user exits.

Uploaded by

Ashish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

#include<stdio.

h>

#include<stdlib.h>

struct DLL

int ssn;

char name[20];

char dept[20];

char desg[20];

int sal;

char phno[11];

struct DLL *prev,*next;

};

typedef struct DLL node;

node *start=NULL;

node* getNode()

node *newnode;

newnode=(node*)malloc(sizeof(node));

printf("Enter ssn, name, department designation,salary, phone number\n");

scanf("%d%s%s%s%d%s",&newnode->ssn,newnode->name,newnode->dept,newnode-
>desg,&newnode->sal,newnode->phno);

newnode->prev=NULL;

newnode->next=NULL;

return newnode;

void insertbegin()

node *newnode;

newnode=getNode();
if(start==NULL)

start=newnode;

else

newnode->next=start;

start->prev=newnode;

start=newnode;

void insertend()

node *newnode,*temp=start;

newnode=getNode();

if(start==NULL)

start=newnode;

return;

while(temp->next!=NULL)

temp=temp->next;

temp->next=newnode;

newnode->prev=temp;

void deletebegin()

node* temp=start;

if(start==NULL)

{
printf("list is empty\n");

return;

printf("deleted node is\n%d\t%s\t%s\t%s\t%d\t%s\n",temp->ssn,temp->name,temp-


>dept,temp->desg,temp->sal,temp->phno);

start->prev=NULL;

start=temp->next;

free(temp);

void deleteend()

node *temp=start;

if(start==NULL)

printf("list is empty\n");

return;

if(start->next==NULL)

printf("deleted node is\n%d\t%s\t%s\t%s\t%d\t%s\n",temp->ssn,temp->name,temp-


>dept,temp->desg,temp->sal,temp->phno);

start=NULL;

free(temp);

else

while(temp->next!=NULL)

temp=temp->next;

(temp->prev)->next=NULL;
printf("deleted node is\n%d\t%s\t%s\t%s\t%d\t%s\n",temp->ssn,temp-
>name,temp->dept,temp->desg,temp->sal,temp->phno);

free(temp);

void display()

node* temp=start;

int count=0;

if(start==NULL)

printf("list is empty\n");

return;

printf("list elements are\n");

while(temp!=NULL)

printf("\n%d\t%s\t%s\t%d\t%s\n ",temp->ssn,temp->name,temp->desg,temp->sal,temp-
>phno);

temp=temp->next;

count++;

printf("no of employees=%d\n\n",count);

int main()

int chioce,n,i;

while(1)

{
printf("enter your chioce 1 for insert end\n 2 for insert begin\n 3 for delete
begin\n");

printf("4 for delete end\n5 for display\n 6 for exit\n");

scanf("%d",&chioce);

switch(chioce)

case 1:printf("enter the no of employees\n");

scanf("%d",&n);

for(i=0;i<n;i++)

insertend();

break;

case 2:insertbegin();

break;

case 3:deletebegin();

break;

case 4:deleteend();

break;

case 5:display();

break;

case 6:exit(0);

break;

default:printf("invalid chioce\n");

You might also like