/*PROGRAM TO TRAVERSE ELEMENTS FROM BOTH SIDES OF DOUBLY LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1; int num; …
/*PROGRAM TO SPLIT TWO DOUBLY LINKED LISTS IN TWO PARTS*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*start1=NULL,*ptr,*ptr1,*temp; int num,item; char …
/*PROGRAM TO SEARCH AN ELEMENT IN A LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *start=NULL,*ptr,*temp; int num,item,c=0,count=0; char ch; …
/*PROGRAM TO SEARCH AN ELEMENT IN A CIRCULAR LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *start=NULL,*ptr,*temp; int num,item,c=0,count=0; char …
/*PROGRAM TO PERFORM PUSH OPERATION ON STACK USING ARRAY*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int maxstk,top=-1,n,a[MAX],i; char ch; clrscr(); //PUSH OPERATION cout<<“Pushing elements into the stack: …
/*PROGRAM TO PERFORM POP OPERATION ON STACK USING ARRAY*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int maxstk,top=-1,n,a[MAX],i; char ch; clrscr(); //PUSH OPERATION cout<<“Pushing elements into the stack: …
/*PROGRAM TO MERGE TWO DOUBLY LINKED LISTS*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*start1=NULL,*ptr,*temp,*temp1,*ptr1,*ptr2; int num; char ch; clrscr(); cout<<“Inserting …
/*PROGRAM TO MERGE TWO ARRAYS*/ #include<conio.h> #include<iostream.h> #define MAX1 10 #define MAX2 5 void main() { int n1=0,n2=0,a[MAX1],b[MAX2],num,i,j; char ch; clrscr(); cout<<“Enter elements in the first array: “<<endl; do { …
/*PROGRAM TO INSERT ELEMENTS IN THE SORTED LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1,*ptr2; int num; char ch; …
/*PROGRAM TO INSERT ELEMENTS IN THE BEGINING OF LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *start=NULL,*ptr,*temp; int num; char …
