Search item in stack linked list by R4R Team


program-

#include< stdio.h>
#include< conio.h>
#include< alloc.h>
struct stack
{
int data;
struct stack *back;
};
struct stack *top;

void create()
{
char ch;
struct stack *ptr,*cpt;
printf("Enter Number\n");
cpt=(struct node*)malloc(sizeof(struct stack));
scanf("%d",&cpt->data);
cpt->back=NULL;
do
{
printf("Enter Number\n");
ptr=(struct stack*)malloc(sizeof(struct stack));
scanf("%d",&ptr->data);
ptr->back=cpt;
cpt=ptr;
printf("Continue(y/n)?\n");
ch=getch();
}while(ch=='y');
top=cpt;
}

void traverse()
{
struct stack *ptr=top;
printf("Stack is :\n");
while(ptr!=NULL)
{
printf("%d ",ptr->data);
ptr=ptr->back;
}
}

void search()
{
struct stack *ptr=top;
int n,i=0;
printf("Enter number to search in stack\n");
scanf("%d",&n);
while(ptr!=NULL)
{
if(ptr->data==n)
break;
ptr=ptr->back;
i++;
}
if(ptr==NULL)
printf("Number is not present in stack");
else
printf("Number is present at %d position",i+1);
}

void main()
{
clrscr();
create();
traverse();
search();
getch();
}


output-

Enter Number
3
Enter Number
4
Continue(y/n)?
Enter Number
7
Continue(y/n)?
Enter Number
1
Continue(y/n)?
Stack is :
1 7 4 3
Enter number to search in stack
4
Number is present at 3 position
-

-In this program, we have a three function create(), traverse() and search()
- create() function are used to create a stack
- traverse() function are used to traverse the stack
- search() function are used to find the element in the stack.




Leave a Comment:
Search
Categories
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!