-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack.c
executable file
·78 lines (54 loc) · 834 Bytes
/
stack.c
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
#include <stdio.h>
#include <stdlib.h>
struct node{
int a;
struct node *next;
};
struct node *top;
struct node *trav;
struct node *temp;
struct node *flag;
void push(int var){
if (top == NULL){
top = (struct node *)(malloc(sizeof(struct node)));
top->a=var;
top->next=NULL;
return;
}
temp=(struct node *)(malloc(sizeof(struct node)));
temp->a=var;
temp->next=top;
top=temp;
}
void pop(){
if (top==NULL){
printf("no node is there so we cammot pop");
return;
}
trav=top;
trav=trav->next;
free(top);
top=trav;
}
void print(){
flag = top;
while(flag != NULL){
printf("%d %p",flag->a,flag);
printf(" ");
flag=flag->next;
}
printf("\n");
}
int main(void){
top=NULL;
push(10);
print();
push(20);
print();
push(30);
print();
push(40);
print();
pop();
print();
}