0% found this document useful (0 votes)

18 views

Amandsa

The document contains C code to implement functions for a doubly linked list including: 1. Functions to create, display, find length of a doubly linked list 2. Functions to insert nodes at the beginning, end, and a specified position of the list 3. Functions to delete nodes from the beginning and end of the list 4. A function to reverse the doubly linked list

Uploaded by

aman180604.sharma

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

0% found this document useful (0 votes)

18 views

Amandsa

Uploaded by

aman180604.sharma

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/ 31

0801IT221017

Q1. WRITE A PROGRAM TO DISPLAY ALL THE FUNCTIONMS OF SINGLY LINKED LIST
#include<stdio.h>

#include<stdlib.h>

#include<math.h>

struct node

{ int data; struct

node *next ;

} *head,*tail;

int l;

int length(){

struct node *temp;

int count=0;

temp = head;

while(temp!=NULL){

count++;

l = count;

temp = temp->next;

printf("length of list %d\n",count);

return count;

void create(){

struct node temp, newnode;

int choice = 1;

head = NULL ;

while(choice){

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

printf("enter the data\n");

1
0801IT221017

scanf("%d", &newnode->data);

newnode->next = NULL;

if(head == NULL){

head = temp = newnode;

else{

temp->next = newnode;

temp = temp->next;

printf("do you want to continue 0/1 \n");

scanf("%d",&choice);

void display(){

printf("display\n");

struct node *temp;

temp = head;

if(head == NULL){

printf("list is empty");

else{

while(temp != NULL){

printf(" %d ",temp->data);

tail = temp;

temp = temp->next;

} printf("\n"); }

2
0801IT221017

void insertAtBeg(){ struct node *newnode;

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

printf("enter data");

scanf("%d",&newnode->data);

newnode->next=NULL;

if(head==NULL){

head=newnode;

else{

newnode->next = head;

head = newnode;

void insertAtEnd(){ struct node *newnode;

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

printf("enter data\n");

scanf("%d",&newnode->data);

newnode->next = NULL;

if(head==NULL){

head = tail = newnode;

else{

tail->next=newnode;

tail=newnode;

void insertAtPos(){ struct node newnode, temp;

3
0801IT221017

temp = head;

int pos, i=1 ;

printf("enter the position\n");

scanf("%d",&pos);

l = length();

if(pos<1||pos>l){

printf("invalid positiion");

else if(pos == 1){

insertAtBeg();

else{

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

newnode->next = NULL;

while(i<pos-1){

temp=temp->next;

i++;

} printf("enter data");

scanf("%d",&newnode->data);

newnode->next = temp->next;

temp->next = newnode;

void reverse(){

struct node prev,nextnode, *current;

prev=NULL;

current=nextnode=head;

while(nextnode!=NULL){

nextnode=nextnode->next;

4
0801IT221017

current->next=prev;

prev=current;

current=nextnode;

head=prev;

void insert(){

struct node newnode,temp;

int choice;

temp = head;

printf("enter 1 for inserting at begining\n");

printf("enter 2 to insert at end\n");

printf("enter 3 to insert at any position\n");

scanf("%d",&choice);

if(choice == 1){

insertAtBeg();

else if(choice == 2){

insertAtEnd();

else{

insertAtPos();

5
0801IT221017

void delfrombeg(){

struct node *temp;

temp = head;

if(head==NULL){

printf("list is empty");

else{

head = head->next;

free(temp);

void delfromend(){

struct node temp, prev;

temp = head;

if(head == NULL){

printf("list is empty\n");

else{

while(temp->next != NULL){

prev = temp;

temp= temp->next;

prev ->next = NULL;

tail=prev;

free(temp);

void delfromPos(){

int l,pos, i=1;

6
0801IT221017

struct node temp, prev;

printf("enter the position\n");

scanf("%d",&pos);

temp = head;

l=length;

if(pos<1 || pos>l){

printf("invalid position\n");

else if(pos == 1){

delfrombeg();

else if(pos == l){

delfromend();

else{ while(i<pos){

prev = temp;

temp = temp->next;

i++;

prev->next = temp->next;

free(temp);

void delete(){

int n;

printf("enter 1 to delete from begining\n");

printf("enter 2 to delete from end\n");

7
0801IT221017

printf("enter 3 to delete from any position\n");

scanf("%d",&n); if(n==1){ delfrombeg();

else if(n==2){

delfromend();

else{

delfromPos();

int main() {

printf("ENROLLEMENT NO: 0801IT221017\n");

printf("SINGLY LINKED LIST\n");

int choice, m=1 ;

while(m){

printf("ENTER 1 TO CREATE\n ENTER 2 TO INSERT \n ENTER 3 TO DELETE \n ENTER 4 TO REVERSE \n

ENTER 5 TO DISPLAY\n");

scanf("%d",&choice);

switch(choice){

case 1 : create();

break;

case 2 : insert();

break;

case 3 : delete();

break;

case 4 : reverse();

8
0801IT221017

break;

case 5 : display();

break;

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

printf("do you want to continue\n");

scanf("%d",&m); }

return 0;

OUTPUT:

9
0801IT221017

Q 2. WRITE A PROGRAM TO SHOW ALL THE OPERATIONS ON DOUBLY LINKED LIST.

ANS.
#include<stdio.h>

#include<stdlib.h>

#include<math.h>

struct node {

int data;

struct node*next,*prev;

} *head,*tail;

int l;

10
0801IT221017

int length(){

struct node *temp;

int count=1;

temp = head;

while(temp!=NULL){

count++;

l = count;

temp = temp->next;

printf("length of list %d\n",count);

return count;

void create(){

struct node *newnode;

int choice = 1;

head = NULL ;

while(choice){

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

printf("enter the data\n");

scanf("%d", &newnode->data);

newnode->next = NULL;

newnode->prev = NULL;

if(head == NULL){

head = tail = newnode;

else{

11
0801IT221017

tail->next = newnode;

newnode->prev = tail;

tail = tail->next;

printf("do you want to continue 0/1 \n");

scanf("%d",&choice);

void display(){

printf("display\n");

struct node *temp;

temp = head;

if(head == NULL){

printf("list is empty");

else{

while(temp != NULL){

printf(" %d",temp->data);

temp = temp->next;

printf("\n");

void insertAtBeg(){

struct node *newnode;

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

printf("enter data");

scanf("%d",&newnode->data);

12
0801IT221017

newnode->next=NULL;

newnode->prev=NULL;

if(head==NULL){

head=newnode;

else{

newnode->next = head;

head = newnode;

void insertAtEnd(){ struct node *newnode;

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

printf("enter data\n");

scanf("%d",&newnode->data);

newnode->next = NULL;

newnode->prev = NULL;

if(head==NULL){

head = tail = newnode;

else{

tail->next=newnode;

newnode->prev=tail;

tail=newnode;

void insertAtPos(){

13
0801IT221017

struct node newnode, temp;

temp = head;

int pos, i=1 , l ;

printf("enter the position\n");

scanf("%d",&pos);

l = length();

if(pos<1||pos>l){

printf("invalid positiion");

else if(pos == 1){

insertAtBeg();

else{

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

newnode->next = NULL;

newnode->prev = NULL;

while(i<pos-1){
temp=temp->next;
i++;

printf("enter data");

scanf("%d",&newnode->data);

newnode->next = temp->next;

newnode->prev = temp;

temp->next = newnode;

void reverse(){

struct nodenextnode, current;

14
0801IT221017

if(head == NULL){

printf("List is empty\n");

else{ current=head;

while(current!=NULL){

nextnode=current->next;

current->next=current->prev;

current->prev=nextnode;

current=nextnode;

current = head;

head=tail;

tail=current;

void insert(){

struct node newnode,temp;

int choice;

temp = head;

printf("enter 1 for inserting at begining\n");

printf("enter 2 to insert at end\n");

printf("enter 3 to insert at any position\n");

scanf("%d",&choice);

if(choice == 1){

insertAtBeg();

else if(choice == 2){

insertAtEnd();

15
0801IT221017

else{

insertAtPos();

void delfrombeg(){

struct node *temp;

temp = head;

if(head==NULL){

printf("list is empty");

else{

head = head->next;

head->prev = NULL;

free(temp);

void delfromend(){

struct node *temp;

temp=tail;

if(tail == NULL){

printf("list is empty\n");

else{

tail=tail->prev;

tail->next = NULL;

free(temp);

}}

16
0801IT221017

void delfromPos(){

int l,pos, i=1;

struct node *temp;

printf("enter the position\n");

scanf("%d",&pos);

temp = head;

l=length;

if(pos<1 || pos>l){

printf("invalid position\n");

else if(pos == 1){

delfrombeg();

else if(pos == l){

delfromend();

else{ while(i<pos){

temp = temp->next;

i++;

temp->prev->next = temp->next;

temp->next->prev=temp->prev;

free(temp);

void delete(){

int n;

17
0801IT221017

printf("enter 1 to delete from begining\n");

printf("enter 2 to delete from end\n");

printf("enter 3 to delete from any position\n");

scanf("%d",&n); if(n==1){

delfrombeg();

else if(n==2){

delfromend();

else{

delfromPos();

int main() {

printf("ENROLLEMENT NO:0801IT221017\n");

printf("DOUBLY LINKED LIST\n");

int choice, m=1 ;

while(m){

printf("ENTER 1 TO CREATE\n ENTER 2 TO INSERT \n ENTER 3 TO DELETE \n ENTER 4 TO REVERSE \n

ENTER 5 TO DISPLAY\n");

scanf("%d",&choice);

switch(choice){

case 1 : create();

break;

case 2 : insert();

break;

case 3 : delete();

break;

case 4 : reverse();

18
0801IT221017

break;

case 5 : display();

break;

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

printf("do you want to continue\n");

scanf("%d",&m);

return 0;

OUTPUT ;

19
0801IT221017

20
0801IT221017

Q 3. WRITE A PROGRAM TO DISPLAY ALL THE FUNCTION IN DOUBLY CIRCULAR LINKED LIST.
ANS.

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

struct node
{
int data;
struct node *next ;
struct node *prev;
} *head,*tail;

int l;
int length(){

struct node *temp;

int count=1;

temp = head;
while(temp!=tail){
count++;

l = count;

temp = temp->next;
}
printf("length of list %d\n",count);
return count;

}
void create(){

21
0801IT221017

struct node *newnode;

int choice = 1;
head = NULL ;
while(choice){
newnode = (struct node*)malloc(sizeof(struct node));
printf("enter the data\n");
scanf("%d", &newnode->data);
newnode->next = newnode;
newnode->prev = newnode;
if(head == NULL){
head = tail = newnode;

}
else{
tail->next = newnode;
newnode->prev = tail;
newnode->next = head;
tail = tail->next;
}
printf("do you want to continue 0/1 \n");
scanf("%d",&choice);
}
}
void display(){
printf("display\n");
struct node *temp;
temp = head;
if(head == NULL){

22
0801IT221017

printf("list is empty");
}
else{

while(temp != tail){
printf(" %d ",temp->data);
temp = temp->next;

}
printf("%d",tail->data);
}
printf("\n");
}
void insertAtBeg(){
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
printf("enter data");
scanf("%d",&newnode->data);
newnode->next=newnode;
newnode->prev=newnode;
if(head==NULL){

head=tail=newnode;

}
else{
newnode->next = head;
head->prev = newnode;
newnode->prev = tail;
head=newnode;
tail->next=head; }

23
0801IT221017

}
void insertAtEnd(){
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
printf("enter data\n");
scanf("%d",&newnode->data);
newnode->next = newnode;
newnode->prev = newnode;
if(head==NULL){

head = tail = newnode;

}
else{
newnode->next=tail->next;
tail->next=newnode;
newnode->prev=tail;
tail=newnode;
head->prev=tail;
}
}
void insertAtPos(){
struct node *newnode, *temp;
temp = head;
int pos, i=1 ;
printf("enter the position\n");
scanf("%d",&pos);
l=length();
/* if(pos<l || pos>l){ printf("invalid positiion");

24
0801IT221017

}*/
if(pos == 1){

insertAtBeg();

}
else{
newnode = (struct node*)malloc(sizeof(struct node));
newnode->next = NULL
newnode->prev = NULL;
while(i<pos-1){
temp=temp->next;
i++;
} printf("enter data");
scanf("%d",&newnode->data);
newnode->next = temp->next;
newnode->prev = temp;
temp->next = newnode;
newnode->next->prev=newnode;
}
}
void reverse(){
struct node *temp, *prevnode, *nextnode;
temp = head;
while(temp != tail){
prevnode = temp->prev;
nextnode = temp->next;
temp->prev = nextnode;
temp->next = prevnode;
temp=nextnode;

25
0801IT221017

}
temp->next=temp->prev;
temp->prev = head;

head = tail;

tail = tail->prev;

}
void insert(){
struct node *newnode,*temp;
int choice;
temp = head;

printf("enter 1 for inserting at begining\n");

printf("enter 2 to insert at end\n");
printf("enter 3 to insert at any position\n");
scanf("%d",&choice);

if(choice == 1){
insertAtBeg();
}
else if(choice == 2){
insertAtEnd();

}
else{
insertAtPos();
}
}
void delfrombeg(){
struct node *temp;

26
0801IT221017

temp = head;
if(head==NULL){
printf("list is empty");

}
else if(head->next == head ){
head=tail=NULL;
free(temp);
}
else{
head=head->next;
tail->next=head;
head->prev=tail;
free(temp);
}
}
void delfromend(){
struct node *temp;
temp=tail;
if(tail == NULL){
printf("list is empty\n");
}
else if(temp->next = tail){
head = tail= NULL;
free(temp);
}
else{ tail=tail->prev;
tail->next = temp->next;

27
0801IT221017

head->prev = tail;
free(temp);

}
}

void delfromPos(){
int l,pos, i=1;
struct node *temp;
printf("enter the position\n");
scanf("%d",&pos);
temp = head;
length();
if(pos<1 || pos>l){
printf("invalid position\n");
}
else if(pos == 1){
delfrombeg();

}
else if(pos == l){
delfromend();
}
else{ while(i<pos){
temp = temp->next;
i++;
}
temp->prev->next = temp->next;

28
0801IT221017

temp->next->prev=temp->prev;
if(temp->next==head){
tail=temp->prev;
}
free(temp);
}
}

void delete(){
int n;
printf("enter 1 to delete from begining\n");
printf("enter 2 to delete from end\n");
printf("enter 3 to delete from any position\n");
scanf("%d",&n);
if(n==1){
delfrombeg();
}
else if(n==2){
delfromend();
}
else{

delfromPos();

}}
int main() {

printf("ENROLLEMENT NO:0801IT221017\n");
printf("CIRCULAR DOUBLY LINKED LIST\n");

int choice, m=1 ; while(m){

29
0801IT221017

printf("ENTER 1 TO CREATE\n ENTER 2 TO INSERT \n ENTER 3 TO DELETE \n ENTER 4 TO

REVERSE \n ENTER 5 TO DISPLAY\n");
scanf("%d",&choice);
switch(choice){ case 1 : create(); break; case 2 : insert(); break; case 3
: delete(); break; case 4 : reverse(); break; case 5 : display(); break;
default : printf("invalid input\n "); }
printf("do you want to continue\n");
scanf("%d",&m);

return 0;
}
OUTPUT :

30
0801IT221017

DSLAB
No ratings yet
DSLAB
49 pages
Data Structures & Algorithms DA5: Lab Assessment-5
No ratings yet
Data Structures & Algorithms DA5: Lab Assessment-5
21 pages
Dsaexp 5
No ratings yet
Dsaexp 5
6 pages
Ds Practical Program
No ratings yet
Ds Practical Program
38 pages
CLL
No ratings yet
CLL
6 pages
doubly linked list
No ratings yet
doubly linked list
6 pages
EXP-4 & 5
No ratings yet
EXP-4 & 5
23 pages
DLL
No ratings yet
DLL
6 pages
DS_labmanual
No ratings yet
DS_labmanual
34 pages
Lab Manual Ex7 To Ex12
No ratings yet
Lab Manual Ex7 To Ex12
11 pages
SLL
No ratings yet
SLL
5 pages
Exercise 3
No ratings yet
Exercise 3
23 pages
DS LAB Manual R22
No ratings yet
DS LAB Manual R22
90 pages
A69 DS Ass10
No ratings yet
A69 DS Ass10
23 pages
Dsa Ela Da 2
No ratings yet
Dsa Ela Da 2
19 pages
PROGRAM (DSA)
No ratings yet
PROGRAM (DSA)
44 pages
10_2
No ratings yet
10_2
4 pages
Doubly Linked List
No ratings yet
Doubly Linked List
3 pages
Queue
No ratings yet
Queue
11 pages
Dsu SP
No ratings yet
Dsu SP
8 pages
Data Structure
No ratings yet
Data Structure
86 pages
Bhaskar (r19 Ds Lab Manual (Cse) )
No ratings yet
Bhaskar (r19 Ds Lab Manual (Cse) )
74 pages
Doubly Linked List Program
No ratings yet
Doubly Linked List Program
5 pages
DS Lab PGM
No ratings yet
DS Lab PGM
43 pages
pl9
No ratings yet
pl9
4 pages
krishG.DS
No ratings yet
krishG.DS
9 pages
DS Prgms
No ratings yet
DS Prgms
62 pages
Ds
No ratings yet
Ds
11 pages
DS program
No ratings yet
DS program
16 pages
160123735197
No ratings yet
160123735197
40 pages
dsa
No ratings yet
dsa
7 pages
It0501 Data Structures and Algorithms Lab Manual
No ratings yet
It0501 Data Structures and Algorithms Lab Manual
54 pages
C Program To Implement Single Linked List
No ratings yet
C Program To Implement Single Linked List
12 pages
DSU Program V2V
No ratings yet
DSU Program V2V
11 pages
Link List Program D
No ratings yet
Link List Program D
22 pages
2012020088_B_CSE assignment
No ratings yet
2012020088_B_CSE assignment
11 pages
Docfile
No ratings yet
Docfile
44 pages
Linked List Programs (Single, Double, Circular)
No ratings yet
Linked List Programs (Single, Double, Circular)
16 pages
Ds Lab Record2022!23!2
No ratings yet
Ds Lab Record2022!23!2
47 pages
Dsa CH 3 Program
No ratings yet
Dsa CH 3 Program
12 pages
8,9,10,11 ACC CODES
No ratings yet
8,9,10,11 ACC CODES
7 pages
DATA STRUCTURE CODE 2
No ratings yet
DATA STRUCTURE CODE 2
28 pages
Doublylinked List Operations
No ratings yet
Doublylinked List Operations
31 pages
Linked List DSA
No ratings yet
Linked List DSA
63 pages
11
No ratings yet
11
4 pages
Double Linklist Creation
No ratings yet
Double Linklist Creation
4 pages
LAB SDA N2 Revenko Ivan-1
No ratings yet
LAB SDA N2 Revenko Ivan-1
7 pages
CLL
No ratings yet
CLL
9 pages
Doublylink
No ratings yet
Doublylink
5 pages
Linkedlist C
No ratings yet
Linkedlist C
7 pages
Linkedlist
No ratings yet
Linkedlist
6 pages
Class 8 and Class 9 Demo Programs
No ratings yet
Class 8 and Class 9 Demo Programs
11 pages
Weekend Homework Anjali Sharma 19MCA0210: Q1. Write A Program To Implement A Circular Doubly Linked List Where The Head
No ratings yet
Weekend Homework Anjali Sharma 19MCA0210: Q1. Write A Program To Implement A Circular Doubly Linked List Where The Head
10 pages
DSA
No ratings yet
DSA
7 pages
SLL_ProgramFunctions
No ratings yet
SLL_ProgramFunctions
10 pages
Lab 8
No ratings yet
Lab 8
8 pages
Double LL Ins, Del
No ratings yet
Double LL Ins, Del
3 pages
week 4 hard
No ratings yet
week 4 hard
7 pages
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
MNG3702 - EXAM 26 May 2025 FINAL QUESTION PAPER_
No ratings yet
MNG3702 - EXAM 26 May 2025 FINAL QUESTION PAPER_
9 pages
Social Development
No ratings yet
Social Development
6 pages
Hansen Et Al 2023
No ratings yet
Hansen Et Al 2023
12 pages
ARTECHE CF Ferro-Resonance EN
No ratings yet
ARTECHE CF Ferro-Resonance EN
12 pages
Earthquake Engineering Course Outline
No ratings yet
Earthquake Engineering Course Outline
2 pages
PYC2602
No ratings yet
PYC2602
33 pages
Assignment - Unit-1: Physics: AS
No ratings yet
Assignment - Unit-1: Physics: AS
13 pages
Exercise2 Submission Group 12 Yalcin Mehmet
No ratings yet
Exercise2 Submission Group 12 Yalcin Mehmet
10 pages
Statistics and Probability: Quarter 4 - Module 2
No ratings yet
Statistics and Probability: Quarter 4 - Module 2
12 pages
Ultra Q Product Brochure
No ratings yet
Ultra Q Product Brochure
8 pages
07 WECC Wind Generator Modeling طاقة الرياح
No ratings yet
07 WECC Wind Generator Modeling طاقة الرياح
15 pages
Rrl website
No ratings yet
Rrl website
12 pages
2023.3 Statement On RSPQ and Signatures
No ratings yet
2023.3 Statement On RSPQ and Signatures
14 pages
Museum Conceptual Analysis and Development
No ratings yet
Museum Conceptual Analysis and Development
16 pages
Direct Linear Transformation (DLT) : 1 Overview
No ratings yet
Direct Linear Transformation (DLT) : 1 Overview
8 pages
Test 7
No ratings yet
Test 7
6 pages
SEA Notes 4
No ratings yet
SEA Notes 4
44 pages
E 1942 - 98 - Rte5nditothfmq
No ratings yet
E 1942 - 98 - Rte5nditothfmq
12 pages
English FAL Marking Guideline_hlayiso.com_
No ratings yet
English FAL Marking Guideline_hlayiso.com_
6 pages
EAPP
No ratings yet
EAPP
2 pages
Wijaxojexugeputukopeveg
0% (1)
Wijaxojexugeputukopeveg
2 pages
Guru Nanak Dev University Amritsar: Faculty of Physical Planning & Architecture
No ratings yet
Guru Nanak Dev University Amritsar: Faculty of Physical Planning & Architecture
103 pages
.Sustainable Tourism Course Outline
No ratings yet
.Sustainable Tourism Course Outline
8 pages
FSM Q.1: For The FSM Above Which of These Inputs Are Valid: 1. Aaacdb 2. Ababacdaaac 3. Abcdb 4. Acda 5. Acdbdb Q.2
No ratings yet
FSM Q.1: For The FSM Above Which of These Inputs Are Valid: 1. Aaacdb 2. Ababacdaaac 3. Abcdb 4. Acda 5. Acdbdb Q.2
10 pages
54762f1e0cf2778985b07c24 PDF
No ratings yet
54762f1e0cf2778985b07c24 PDF
694 pages
Soil Resources
No ratings yet
Soil Resources
17 pages
MIL Presentation (Lesson 2)
No ratings yet
MIL Presentation (Lesson 2)
14 pages
Engineering Drawings - Thayer
100% (1)
Engineering Drawings - Thayer
39 pages
Index Number - Summary Notes
100% (1)
Index Number - Summary Notes
2 pages
Microleakage of Preheated Composites
No ratings yet
Microleakage of Preheated Composites
18 pages

Amandsa

Uploaded by

Amandsa

Uploaded by

0801IT221017

{ int data; struct

struct node *temp;

printf("length of list %d\n",count);

struct node *temp, *newnode;

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

printf("enter the data\n");

head = temp = newnode;

printf("do you want to continue 0/1 \n");

struct node *temp;

void insertAtBeg(){ struct node *newnode;

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

void insertAtEnd(){ struct node *newnode;

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

head = tail = newnode;

void insertAtPos(){ struct node *newnode, *temp;

int pos, i=1 ;

printf("enter the position\n");

else if(pos == 1){

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

struct node *prev,*nextnode, *current;

struct node *newnode,*temp;

printf("enter 1 for inserting at begining\n");

printf("enter 2 to insert at end\n");

printf("enter 3 to insert at any position\n");

else if(choice == 2){

struct node *temp;

struct node *temp, *prev;

prev ->next = NULL;

int l,pos, i=1;

struct node *temp, *prev;

printf("enter the position\n");

else if(pos == 1){

else if(pos == l){

printf("enter 1 to delete from begining\n");

printf("enter 2 to delete from end\n");

printf("enter 3 to delete from any position\n");

scanf("%d",&n); if(n==1){ delfrombeg();

printf("ENROLLEMENT NO: 0801IT221017\n");

printf("SINGLY LINKED LIST\n");

int choice, m=1 ;

printf("ENTER 1 TO CREATE\n ENTER 2 TO INSERT \n ENTER 3 TO DELETE \n ENTER 4 TO REVERSE \n

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

printf("do you want to continue\n");

Q 2. WRITE A PROGRAM TO SHOW ALL THE OPERATIONS ON DOUBLY LINKED LIST.

struct node *temp;

printf("length of list %d\n",count);

struct node *newnode;

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

printf("enter the data\n");

head = tail = newnode;

printf("do you want to continue 0/1 \n");

struct node *temp;

struct node *newnode;

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

void insertAtEnd(){ struct node *newnode;

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

head = tail = newnode;

struct node *newnode, *temp;

int pos, i=1 , l ;

printf("enter the position\n");

else if(pos == 1){

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

struct node*nextnode, *current;

struct node *newnode,*temp;

printf("enter 1 for inserting at begining\n");

printf("enter 2 to insert at end\n");

printf("enter 3 to insert at any position\n");

else if(choice == 2){

struct node *temp;

struct node *temp;

int l,pos, i=1;

struct node *temp;

printf("enter the position\n");

else if(pos == 1){

else if(pos == l){

struct node temp, newnode;

void insertAtPos(){ struct node newnode, temp;

struct node prev,nextnode, *current;

struct node newnode,temp;

struct node temp, prev;

struct node temp, prev;

struct node newnode, temp;

struct nodenextnode, current;

struct node newnode,temp;