Scribd
Upload
14 views4 pages

DSA_EXP_7[1]

Uploaded by

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

DSA_EXP_7[1]

Uploaded by

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

ATHARVA EDUCATIONAL TRUST'S

ATHARVA COLLEGE OF
ENGINEERING
(Approved by AICTE, Recognized by Government of Maharashtra
& Affiliated to University of Mumbai - Estd. 1999 - 2000)
ISO 2100:2018 ISO 14001:2015 ISO 9001:2015
NAAC Accredited with Grade A+

NAME =
BRANCH = SE ECS BATCH = B1
ROLL NO. =
EXPERIMENT N0.7 = To Implement Stack Using Linked List

Program :

##include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <malloc.h> struct
stack
{ int
data;
struct stack *next;
};
struct stack *top = NULL; struct
stack *push(struct stack *, int); struct
stack *display(struct stack *); struct
stack *pop(struct stack *); int
peek(struct stack *); int main(int
argc, char *argv[]) {
int val, option;
do
{
printf("\n *****MAIN MENU*****");
printf("\n 1. PUSH"); printf("\n
2. POP"); printf("\n 3.
PEEK"); printf("\n 4.
DISPLAY"); printf("\n 5.
EXIT"); printf("\n Enter your
option: "); scanf("%d",
&option); switch(option)
{ case 1: printf("\n Enter the number to be pushed on
stack: "); scanf("%d", &val); top = push(top, val);
break; case 2: top = pop(top); break; case 3: val =
peek(top); if (val != -1)
printf("\n The value at the top of stack is: %d", val);
else
printf("\n STACK IS EMPTY");
break; case 4: top
= display(top);
break;
}
}while(option != 5);
return 0; }
struct stack *push(struct stack *top, int val)
{ struct stack
*ptr;
ptr = (struct stack*)malloc(sizeof(struct stack)); ptr
-> data = val;
if(top == NULL)
{ ptr -> next =
NULL; top = ptr; }
else { ptr -> next =
top; top = ptr; }
return top; }
struct stack *display(struct stack *top)
{ struct stack
*ptr;
ptr = top; if(top == NULL)
printf("\n STACK IS EMPTY");
else {
while(ptr != NULL)
{ printf("\n %d", ptr ->
data); ptr = ptr -> next;
} } return
top; }
struct stack *pop(struct stack *top)
{ struct stack *ptr; ptr = top; if(top
== NULL) printf("\n STACK
UNDERFLOW");
else { top = top -
> next;
printf("\n The value being deleted is: %d", ptr -> data);
free(ptr); } return top; }
int peek(struct stack *top)
{
if(top==NULL)
return -1; else
return top ->data;
}

OUTPUT :

You might also like