-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.cpp
102 lines (92 loc) · 1.11 KB
/
stack.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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include<iostream>
#include<stdlib.h>
using namespace std;
struct node
{
int data;
struct node *link;
};
struct node *Top = NULL;
void push (int data)
{
struct node *temp;
temp = (node*)malloc(sizeof(node));
temp->link = NULL;
temp->data = data;
if(Top==NULL)
{
Top = temp;
}
else
{
temp->link = Top;
Top = temp;
}
}
int pop()
{
int data;
if(Top==NULL)
{
cout<<"Stack Underflow"<<endl;
return(0);
}
else
{
struct node *temp;
data = Top->data;
temp = Top;
Top = Top->link;
free(temp);
return(data);
}
}
void display()
{
if(Top==NULL)
{
cout<<"Stack Underflow"<<endl;
}
else
{
struct node *temp = Top;
while(temp!=NULL)
{
cout<<temp->data<<" "<<endl;
temp = temp->link;
}
}
}
int count()
{
if(Top==NULL)
{
return(0);
}
else
{
int x;
struct node* temp =Top;
while(temp!=NULL)
{
x++;
temp = temp->link;
}
return(x);
}
}
int main()
{
pop();
push(10);
push(20);
push(30);
push(40);
push(50);
cout<<"Total nodes = "<<count()<<endl;
pop();
cout<<"Pop = "<<pop()<<endl;
cout<<"Total nodes = "<<count()<<endl;
display();
return(0);
}