Repository navigation
Expand file tree
/
Copy pathstack.cpp
More file actions
106 lines (97 loc) · 1.69 KB
/
Copy pathstack.cpp
File metadata and controls
106 lines (97 loc) · 1.69 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/* Part of Cosmos by OpenGenus Foundation */
#include <iostream>
#include <cstdlib>
#include <climits>
using namespace std;
template <typename T>
struct Node
{
T n;
Node* next;
};
template <class T>
class Stack
{
private:
Node<T>* top;
public:
Stack();
~Stack();
void push(T);
T pop();
void display();
};
template <class T> Stack<T>::Stack()
{
top = nullptr;
}
template <class T> Stack<T>::~Stack()
{
if (top)
{
Node<T>* ptr = top;
while (ptr)
{
Node<T>* tmp = ptr;
ptr = ptr->next;
delete tmp;
}
}
}
template <class T> void Stack<T>::push(T n)
{
Node<T>* ptr = new Node<T>;
ptr->n = n;
ptr->next = top;
top = ptr;
}
template <class T> T Stack<T>::pop()
{
if (top == nullptr)
return INT_MIN;
Node<T>* ptr = top;
T n = ptr->n;
top = top->next;
delete ptr;
return n;
}
template <class T> void Stack<T>::display()
{
Node<T>* ptr = top;
while (ptr != nullptr)
{
cout << ptr->n << "-> ";
ptr = ptr->next;
}
cout << "NULL" << endl;
}
int main()
{
Stack<int> S;
int n, choice;
while (choice != 4)
{
cout << "1.Push" << endl
<< "2.Pop" << endl
<< "3.Display" << endl
<< "4.Exit" << endl;
cin >> choice;
switch (choice)
{
case 1:
cout << "Enter the element to be entered. ";
cin >> n;
S.push(n);
break;
case 2:
S.pop();
break;
case 3:
S.display();
break;
default:
break;
}
}
return 0;
}