-
Notifications
You must be signed in to change notification settings - Fork 0
/
Lesson_4_Stacks.cpp
69 lines (54 loc) · 991 Bytes
/
Lesson_4_Stacks.cpp
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
// Stack implementation using arrays
#include <iostream>
#include <stdio.h>
/*
#define max_size 7
int A[max_size];
int top=-1;
void push(int x){
if(top==max_size-1){ //array is full
printf("Stack overflow");
}
A[++top]=x;
}
int pop(){
if (top==-1){
printf("error: nothing to pop");
}
top=top-1;
return A[top+1];
}
int main(){
push(1);
push(3);
printf("%d",pop());
printf("%d",pop());
printf("%d",pop());
}*/
struct A{
int data;
struct A* next;
};
struct A* top=NULL;
void Push(int x){
struct A* node= (struct A*)malloc(sizeof(A));
node->data=x;
node->next=top;
top=node;
}
void Pop(){
if (top==NULL){
printf("Empty list!");
return;
}
struct A* temp=top;
printf("%d",top->data);
top=top->next;
free(temp);
}
int main(){
Pop();
Push(5);
Push(0);
Pop();
}