-
Notifications
You must be signed in to change notification settings - Fork 1
/
StackUsingLinkedList.cpp
84 lines (76 loc) · 1.33 KB
/
StackUsingLinkedList.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
#include <iostream>
#include <stack>
using namespace std;
// Last in first out -> Stack
// Make a stack using linked list.
// infix to postfix
// postfix evaluate
struct Node
{
int data;
Node *next;
};
class Stack
{
private:
Node *top;
public:
Stack()
{
top = NULL;
}
bool isEmpty()
{
return top == NULL;
}
void push(int value)
{
// Overflow condition
Node *newNode = new Node;
newNode->data = value;
newNode->next = top;
top = newNode;
}
// pop
int pop()
{
if (isEmpty())
{
cout << "Stack is empty" << '\n';
return -1;
}
int value = top->data;
Node *temp = top;
top = top->next;
delete temp;
return value;
}
void printStack()
{
if (isEmpty())
{
cout << "Stack is empty." << endl;
return;
}
Node *temp = top;
while (temp != NULL)
{
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
};
int main()
{
Stack s;
s.push(10);
s.printStack();
s.push(20);
s.printStack();
s.push(30);
s.printStack();
cout << "Popped Value : " << s.pop() << '\n';
s.printStack();
return 0;
}