-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstackusinglinkedlist.c
More file actions
86 lines (67 loc) · 1.3 KB
/
Copy pathstackusinglinkedlist.c
File metadata and controls
86 lines (67 loc) · 1.3 KB
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
74
75
76
77
78
79
80
81
82
83
84
85
86
//STACK USING LINKEDLIST
#include <stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
}*tos,*new,*temp;
void push(int value)
{
new=(struct node*)malloc(sizeof(struct node*));
new->data=value;
new->next=NULL;
if(tos==NULL)
{
tos=new;
}
else
{
new->next=tos;
tos=new;
}
}
void pop()
{
temp=tos;
printf("Popped element is %d\n",tos->data);
tos=tos->next;
temp->next=NULL;
free(temp);
}
void display()
{
while(tos!=NULL)
{
printf("%d\t",tos->data);
tos=tos->next;
}
}
int main()
{
int n,k;
while(1)
{
printf("\nEnter an option from below list:\n");
printf("1)To Push element into stack\n2)To Pop element from stack\n3)To Display\n4)To Exit\n");
scanf("%d",&n);
switch(n)
{
case 1:
printf("Enter an element to push:-");
scanf("%d",&k);
push(k);
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
exit(0);
break;
}
}
return 0;
}