-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstackLinkedlist.c
More file actions
73 lines (66 loc) · 1002 Bytes
/
stackLinkedlist.c
File metadata and controls
73 lines (66 loc) · 1002 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
//implementing stack using Linked list
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node* link;
};
struct node* top=NULL;
void push(int);
void pop(void);
void display(void);
void main(){
int n,ele;
while(1){
printf("1)push\n 2)pop\n 3)display");
scanf("%d",&n);
switch(n){
case 1:
printf("enter element\n");
scanf("%d",&ele);
push(ele);
break;
case 2:
pop();
break;
case 3:
display();
break;
default:
exit(0);
}
}
}
void push(int ele){
struct node* temp;
temp=(struct node*)malloc(sizeof(struct node));
temp->data=ele;
temp->link=top;
top=temp;
}
void pop(){
struct node* temp;
temp=top;
if(temp==NULL){
printf("stack empty\n");
}
else{
printf("element popped = %d\n",temp->data);
top=temp->link;
free(temp);
}
}
void display(){
struct node* temp;
temp=top;
if(temp==NULL){
printf("stack empty\n");
}
else{
while(temp!=NULL){
printf("%d\n",temp->data);
temp=temp->link;
}
}
}