0% found this document useful (0 votes)

7 views

Assignment

Uploaded by

prantoriyad713

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

7 views

Assignment

Uploaded by

prantoriyad713

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 18

CREAT A LINKLIST(single)

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

void print(struct NODE* head){

struct NODE* temp=head;

while(temp!=NULL){

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

temp=temp->next;

int main(){

struct NODE* head=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* current=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=10;

current->data=20;

ptr->data=30;

head->next=current;

current->next=ptr;

ptr->next=NULL;

print(head);

return 0;

}
Insert Node First
#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

struct NODE add(struct NODE head,int d){

struct NODE temp=(struct NODE)malloc(sizeof(struct NODE));

temp->data=d;

temp->next=head;

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->next=current;

current->next=ptr;

ptr->next=NULL;

int d=10;

head=add(head,d);

while(head!=NULL){

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

head=head->next;

return 0;

}
Insert Node First(DOUBLE)
#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

struct NODE* prev;

};

struct NODE add(struct NODE head,int d){

struct NODE temp=(struct NODE)malloc(sizeof(struct NODE));

temp->data=d;

temp->prev=NULL;

temp->next=head;

head->prev=temp;

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->prev=NULL;

current->prev=head;

ptr->prev=current;

head->next=current;

current->next=ptr;

ptr->next=NULL;

int d=10;

head=add(head,d);
while(head!=NULL){

printf("%d <->",head->data);

head=head->next;

printf("NULL \n");

return 0;

Insart Node Last

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

void add(struct NODE* head,int d){

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

temp->data=d;

temp->next=NULL;

while(ne->next!=NULL){

ne=ne->next;

ne->next=temp;

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;
ptr->data=40;

head->next=current;

current->next=ptr;

ptr->next=NULL;

int d=10;

add(head,d);

while(head!=NULL){

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

head=head->next;

return 0;

Insert Node Last(DOUBLE)

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

struct NODE* prev;

};

void add(struct NODE* head,int d){

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

temp->data=d;

temp->next=NULL;

while(ne->next!=NULL){

ne=ne->next;

ne->next=temp;

temp->prev=ne;

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->prev=NULL;

current->prev=head;

ptr->prev=current;

head->next=current;

current->next=ptr;

ptr->next=NULL;

int d=10;

add(head,d);

while(head!=NULL){

printf("%d<->",head->data);

head=head->next;

printf("NULL");

return 0;

Insart Node Anywhere

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

void add(struct NODE* head,int d){

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

temp->data=d;

temp->next=NULL;

while(ne->data!=30){

ne=ne->next;
}

temp->next=ne->next;

ne->next=temp;

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->next=current;

current->next=ptr;

ptr->next=NULL;

int d=10;

add(head,d);

while(head!=NULL){

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

head=head->next;

return 0;

Insart Node Anywhere(DOUBLE)

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

struct NODE* prev;

};

void add(struct NODE* head,int d){

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

temp->data=d;

temp->next=NULL;

while(ne->data!=30){

ne=ne->next;

temp->prev=ne;

temp->next=ne->next;

ne->next=temp;

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->prev=NULL;

current->prev=head;

ptr->prev=current;

head->next=current;

current->next=ptr;

ptr->next=NULL;

int d=10;

add(head,d);

while(head!=NULL){

printf("%d<->",head->data);

head=head->next;

printf("NULL");
return 0;

DELET NODE FIRST

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

struct NODE delet(struct NODE head){

struct NODE *temp=head;

if(temp->next==NULL){

printf("THE LIST IS EMPTY!");

}else{

struct NODE* p=temp;

temp=temp->next;

free(p);

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->next=current;

current->next=ptr;

ptr->next=NULL;
head=delet(head);

while(head!=NULL){

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

head=head->next;

return 0;

DELET NODE FIRST(DOUBLE)

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

struct NODE* prev;

};

struct NODE delet(struct NODE head){

struct NODE *temp=head;

if(temp->next==NULL){

printf("THE LIST IS EMPTY!");

}else{

struct NODE* p=temp;

temp=temp->next;

free(p);

p=NULL;

temp->prev=NULL;

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->prev=NULL;

current->prev=head;

ptr->prev=current;

head->next=current;

current->next=ptr;

ptr->next=NULL;

head=delet(head);

while(head!=NULL){

printf("%d<->",head->data);

head=head->next;

printf("NULL");

return 0;

DELET NODE LAST

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

struct NODE delet(struct NODE head){

struct NODE *temp=head;

if(temp->next==NULL){

printf("THE LIST IS EMPTY!");

}else{
struct NODE* temp1=temp;

struct NODE* temp2=temp;

while(temp2->next!=NULL){

temp1=temp2;

temp2=temp2->next;

temp1->next=NULL;

free(temp2);

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->next=current;

current->next=ptr;

ptr->next=NULL;

head=delet(head);

while(head!=NULL){

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

head=head->next;

return 0;

DELET NODE LAST(DOUBLE)

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

struct NODE{

int data;

struct NODE* next;

struct NODE* prev;

};

struct NODE delet(struct NODE head){

struct NODE *temp=head;

if(temp->next==NULL){

printf("THE LIST IS EMPTY!");

}else{

struct NODE* p=temp;

temp=temp->next;

free(p);

p=NULL;

temp->prev=NULL;

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

head->prev=NULL;

current->prev=head;

ptr->prev=current;

head->next=current;
current->next=ptr;

ptr->next=NULL;

head=delet(head);

while(head!=NULL){

printf("%d<->",head->data);

head=head->next;

printf("NULL");

return 0;

DELET PARTICULAR NODE

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

struct NODE delet(struct NODE head){

struct NODE *temp=head;

if(temp->next==NULL){

printf("THE LIST IS EMPTY!");

}else{

struct NODE* temp1=temp;

struct NODE* temp2=temp;

while(temp2->data!=40){

temp1=temp2;

temp2=temp2->next;

temp1->next=temp2->next;

free(temp2);

head=temp;
return head;

};

int main(){

struct NODE head=NULL,current=NULL,ptr=NULL,top=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

top=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

top->data=50;

head->next=current;

current->next=ptr;

ptr->next=top;

top->next=NULL;

head=delet(head);

while(head!=NULL){

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

head=head->next;

return 0;

DELET PARTICULAR NODE(DOUBLE)

#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

struct NODE* prev;

};

struct NODE delet(struct NODE head){

struct NODE *temp=head;

if(temp->next==NULL){

printf("THE LIST IS EMPTY!");

}else{

struct NODE* temp1=temp;

struct NODE* temp2=temp;

while(temp2->data!=40){

temp1=temp2;

temp2=temp2->next;

temp1->next=temp2->next;

temp2->prev=NULL;

free(temp2);

head=temp;

return head;

};

int main(){

struct NODE head=NULL,current=NULL,ptr=NULL,top=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

top=(struct NODE*)malloc(sizeof(struct NODE));

head->data=20;

current->data=30;

ptr->data=40;

top->data=50;

head->prev=NULL;

current->prev=head;

ptr->prev=current;

top->prev=ptr;

head->next=current;

current->next=ptr;
ptr->next=top;

top->next=NULL;

head=delet(head);

while(head!=NULL){

printf("%d<->",head->data);

head=head->next;

printf("NULL");

return 0;

CIRCULAR LINKLIST(Singly)
#include<stdio.h>

#include<stdlib.h>

struct NODE{

int data;

struct NODE* next;

};

void print(struct NODE* head,int n){

struct NODE* p=head;

struct NODE* temp=head;

do{

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

temp=temp->next;

}while(

temp->next!=p->next

);

int main(){

struct NODE* head=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* current=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* ptr=(struct NODE*)malloc(sizeof(struct NODE));

head->data=10;

current->data=20;
ptr->data=30;

head->next=current;

current->next=ptr;

ptr->next=head;

int NUMBEROFNODE=3;

print(head,NUMBEROFNODE);

return 0;

Wave - Tutorial
100% (1)
Wave - Tutorial
59 pages
Calypso: Option 8 Rds-Caa
No ratings yet
Calypso: Option 8 Rds-Caa
26 pages
Doublylink
No ratings yet
Doublylink
5 pages
DOUBLY LINKED LIST
No ratings yet
DOUBLY LINKED LIST
3 pages
dsfile
No ratings yet
dsfile
11 pages
Exp No: Date
No ratings yet
Exp No: Date
56 pages
Linked List Program
No ratings yet
Linked List Program
19 pages
Data Structure Unit 3 PPT
No ratings yet
Data Structure Unit 3 PPT
61 pages
Notes CP
No ratings yet
Notes CP
46 pages
Linked List DSA
No ratings yet
Linked List DSA
63 pages
Data Structures
No ratings yet
Data Structures
128 pages
Assignment 2
No ratings yet
Assignment 2
54 pages
ds
No ratings yet
ds
17 pages
2.single_linked_list
No ratings yet
2.single_linked_list
4 pages
Dsa PPS3
No ratings yet
Dsa PPS3
22 pages
Circular Linked List
No ratings yet
Circular Linked List
6 pages
Exercise 3
No ratings yet
Exercise 3
23 pages
Data Structure 1B, C
No ratings yet
Data Structure 1B, C
18 pages
Linked List Programs (Single, Double, Circular)
No ratings yet
Linked List Programs (Single, Double, Circular)
16 pages
Exp No: Date
No ratings yet
Exp No: Date
22 pages
Linked List in C
No ratings yet
Linked List in C
14 pages
circular_singly_linkedlists
No ratings yet
circular_singly_linkedlists
10 pages
Exp No: Date
No ratings yet
Exp No: Date
24 pages
Doublylinked List Operations
No ratings yet
Doublylinked List Operations
31 pages
19BCS2191 DAA Exp4
No ratings yet
19BCS2191 DAA Exp4
27 pages
Linked List Try
No ratings yet
Linked List Try
6 pages
2.double Linked List
No ratings yet
2.double Linked List
8 pages
Asisignment 4 Code-1-12
No ratings yet
Asisignment 4 Code-1-12
12 pages
Dsa Manual (2022) - 1-16
No ratings yet
Dsa Manual (2022) - 1-16
16 pages
Week 5
No ratings yet
Week 5
15 pages
Code 12
No ratings yet
Code 12
4 pages
Linked List
No ratings yet
Linked List
22 pages
CTSD C03 &co4
No ratings yet
CTSD C03 &co4
38 pages
DS program
No ratings yet
DS program
16 pages
BPRACT6
No ratings yet
BPRACT6
5 pages
Rajat Kumar Singh - DS Lab-01
No ratings yet
Rajat Kumar Singh - DS Lab-01
7 pages
Circular Linked List Operations
No ratings yet
Circular Linked List Operations
20 pages
Double and circular linked list
No ratings yet
Double and circular linked list
4 pages
EXP-4 & 5
No ratings yet
EXP-4 & 5
23 pages
Ds Exp 8 Code
No ratings yet
Ds Exp 8 Code
4 pages
linked list
No ratings yet
linked list
17 pages
DSU-PR-11
No ratings yet
DSU-PR-11
7 pages
Lab 7
No ratings yet
Lab 7
9 pages
Linked List Implementation in C
No ratings yet
Linked List Implementation in C
17 pages
linked list
No ratings yet
linked list
3 pages
Insert at Begin
No ratings yet
Insert at Begin
9 pages
DSA Practical No 1
No ratings yet
DSA Practical No 1
8 pages
Doubly Linked List: Madhuri.c 1NT19IS077 Ise C
No ratings yet
Doubly Linked List: Madhuri.c 1NT19IS077 Ise C
14 pages
LL
No ratings yet
LL
2 pages
Exp 6 - Dsa Lab File
No ratings yet
Exp 6 - Dsa Lab File
38 pages
It-353 Experiment File: Submitted By: Samruddhi Kadam (2K19/Ae/052) (G1) Submitted To: Prof. Ruchi Holker
No ratings yet
It-353 Experiment File: Submitted By: Samruddhi Kadam (2K19/Ae/052) (G1) Submitted To: Prof. Ruchi Holker
16 pages
Data Structures & Algorithms DA5: Lab Assessment-5
No ratings yet
Data Structures & Algorithms DA5: Lab Assessment-5
21 pages
DS Rec
No ratings yet
DS Rec
44 pages
Assignement Ds
No ratings yet
Assignement Ds
8 pages
Dsa Ela Da 2
No ratings yet
Dsa Ela Da 2
19 pages
Linked Lists
No ratings yet
Linked Lists
11 pages
2012020088_B_CSE assignment
No ratings yet
2012020088_B_CSE assignment
11 pages
Double LinkList Implement Steps by Step On 25-9
No ratings yet
Double LinkList Implement Steps by Step On 25-9
5 pages
CLL
No ratings yet
CLL
9 pages
Linked List
No ratings yet
Linked List
6 pages
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
150+ C Pattern Programs
From Everand
150+ C Pattern Programs
Hernando Abella
No ratings yet
Xco-3 2 0-Releasenotes
No ratings yet
Xco-3 2 0-Releasenotes
44 pages
UniFi - Controller - V5 - User's Guide PDF
No ratings yet
UniFi - Controller - V5 - User's Guide PDF
158 pages
Migrating From Broker To Universal Messaging - Webinar - Dec 2015
100% (1)
Migrating From Broker To Universal Messaging - Webinar - Dec 2015
21 pages
Computer Application Packages Ii Lecture Note
No ratings yet
Computer Application Packages Ii Lecture Note
18 pages
IT Workshop Lab Manual
No ratings yet
IT Workshop Lab Manual
100 pages
HP 4645 Short Manual
No ratings yet
HP 4645 Short Manual
80 pages
ID Perancangan Sistem Pembayaran Billing System Pasien Di Rumah Sakit Umum Inanta P PDF
No ratings yet
ID Perancangan Sistem Pembayaran Billing System Pasien Di Rumah Sakit Umum Inanta P PDF
7 pages
Async With CompletableFuture
No ratings yet
Async With CompletableFuture
9 pages
1st Boot Camp OSBD Alliance 16 December 2024
No ratings yet
1st Boot Camp OSBD Alliance 16 December 2024
3 pages
Tarun Bhatt Resume
No ratings yet
Tarun Bhatt Resume
2 pages
mca-3-sem-software-engineering-mca509-dec-2017
No ratings yet
mca-3-sem-software-engineering-mca509-dec-2017
1 page
Restricting Access With HTTP Basic Authentication - NGINX Plus
No ratings yet
Restricting Access With HTTP Basic Authentication - NGINX Plus
3 pages
ENGLISH10Q2 Module 6 Abanilla
No ratings yet
ENGLISH10Q2 Module 6 Abanilla
29 pages
ErrorLog - 08 26 2021
No ratings yet
ErrorLog - 08 26 2021
2 pages
Yosys+Nextpnr: An Open Source Framework From Verilog To Bitstream For Commercial Fpgas
No ratings yet
Yosys+Nextpnr: An Open Source Framework From Verilog To Bitstream For Commercial Fpgas
4 pages
Fatawa Usmani Vol 04
No ratings yet
Fatawa Usmani Vol 04
554 pages
Expert PHP and MySQL 1st Edition Andrew Curioso instant download
No ratings yet
Expert PHP and MySQL 1st Edition Andrew Curioso instant download
62 pages
Luthfi Rahmandhani - 211110111120004 - LAMPIRAN
No ratings yet
Luthfi Rahmandhani - 211110111120004 - LAMPIRAN
50 pages
SC 5000VD
No ratings yet
SC 5000VD
11 pages
Best Practice iOS Development
No ratings yet
Best Practice iOS Development
2 pages
C5 Operations Manual
No ratings yet
C5 Operations Manual
54 pages
Various Components of E-Commercedocx
No ratings yet
Various Components of E-Commercedocx
2 pages
Computer Organization and Assembly Language Lab Manual (Lab 03)
No ratings yet
Computer Organization and Assembly Language Lab Manual (Lab 03)
6 pages
AI Prompts - Formulas in Excel
No ratings yet
AI Prompts - Formulas in Excel
14 pages
User Manual: Version 4.3 - June 2021
No ratings yet
User Manual: Version 4.3 - June 2021
146 pages
OPS113 - Project 2
No ratings yet
OPS113 - Project 2
4 pages
BCAghvhj530-537 Linux - Practical
No ratings yet
BCAghvhj530-537 Linux - Practical
1 page
Undelusively Reekers Black-Clad
No ratings yet
Undelusively Reekers Black-Clad
2 pages

Assignment

Uploaded by

Assignment

Uploaded by

CREAT A LINKLIST(single)

struct NODE* next;

void print(struct NODE* head){

struct NODE* temp=head;

struct NODE* head=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* current=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* ptr=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* next;

struct NODE *add(struct NODE *head,int d){

struct NODE *temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE* next;

struct NODE* prev;

struct NODE *add(struct NODE *head,int d){

struct NODE *temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

Insart Node Last

struct NODE* next;

void add(struct NODE* head,int d){

struct NODE *ne=head,* temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

Insert Node Last(DOUBLE)

struct NODE* next;

struct NODE* prev;

void add(struct NODE* head,int d){

struct NODE *ne=head,* temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

Insart Node Anywhere

struct NODE* next;

void add(struct NODE* head,int d){

struct NODE *ne=head,* temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

Insart Node Anywhere(DOUBLE)

struct NODE* next;

struct NODE* prev;

void add(struct NODE* head,int d){

struct NODE *ne=head,* temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

DELET NODE FIRST

struct NODE* next;

struct NODE *delet(struct NODE *head){

struct NODE *temp=head;

printf("THE LIST IS EMPTY!");

struct NODE* p=temp;

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

ptr=(struct NODE*)malloc(sizeof(struct NODE));

DELET NODE FIRST(DOUBLE)

struct NODE* next;

struct NODE* prev;

struct NODE *delet(struct NODE *head){

struct NODE *temp=head;

printf("THE LIST IS EMPTY!");

struct NODE* p=temp;

struct NODE *head=NULL,*current=NULL,*ptr=NULL;

head= (struct NODE*)malloc(sizeof(struct NODE));

current=(struct NODE*)malloc(sizeof(struct NODE));

DELET NODE LAST

struct NODE add(struct NODE head,int d){

struct NODE temp=(struct NODE)malloc(sizeof(struct NODE));

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE add(struct NODE head,int d){

struct NODE temp=(struct NODE)malloc(sizeof(struct NODE));

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE ne=head, temp=(struct NODE*)malloc(sizeof(struct NODE));

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE delet(struct NODE head){

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE delet(struct NODE head){

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE delet(struct NODE head){

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE delet(struct NODE head){

struct NODE head=NULL,current=NULL,*ptr=NULL;

struct NODE delet(struct NODE head){

struct NODE head=NULL,current=NULL,ptr=NULL,top=NULL;

struct NODE delet(struct NODE head){

struct NODE head=NULL,current=NULL,ptr=NULL,top=NULL;