Generalised-Data-Structures-Library/Stack.cpp at main · yogikh2005/Generalised-Data-Structures-Library · GitHub

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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#include<iostream>
using namespace std;

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//              Stack using Generic Approach
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#pragma pack(1)
template <class T>
class Stacknode
{
    public:
        T data;
        Stacknode<T> *next;

        Stacknode(T no)
        {
            this->data = no;
            this->next = NULL;
        }
};

template <class T>
class Stack
{
    private:
        Stacknode<T> *first;
        int iCount;

    public:
        Stack();
        void push(T);
        T pop();
        T peep();
        void Display();
        int Count();
};

template <class T>
Stack<T> :: Stack()
{
    cout<<"Stack gets created successfully.\n\n";
    this->first = NULL;
    this->iCount = 0;
}

template <class T>
void Stack<T> :: push(T no)
{
    Stacknode<T> * newn = NULL;

    newn = new Stacknode<T>(no);

    newn->next = this->first;
    this->first = newn;

    this->iCount++;
}

template <class T>
T Stack<T> :: pop()
{
    T Value = 0;
    Stacknode<T> * temp = this->first;

    if(this->first == NULL)
    {
        cout<<"Stack is Empty\n";
        return -1;
    }

    Value = this->first->data;

    this->first = this->first->next;
    delete temp;

    this->iCount--;
    return Value;
}

template <class T>
T Stack<T> :: peep()
{
    T Value = 0;

    if(this->first == NULL)
    {
        cout<<"Stack is Empty\n";
        return -1;
    }

    Value = this->first->data;

    return Value;
}

template <class T>
void Stack<T> :: Display()
{
    Stacknode<T> * temp = NULL;

    temp = this->first;

    if(this->first == NULL)
    {
        cout<<"Stack is empty\n";
        return;
    }

    while(temp != NULL)
    {
        cout<<"|\t"<<temp->data<<"\t|\n";
        temp = temp->next;
    }
}

template <class T>
int Stack<T> :: Count()
{
    return this->iCount;
}

int main()
{
     cout<<"------------------------------------ STACK ------------------------------------\n";

    Stack<char> * sobj = new Stack<char>();

    sobj->push('P');
    sobj->push('Q');
    sobj->push('R');
    sobj->push('S');

    sobj->Display();
    cout<<"Number of elements in Stack are: "<<sobj->Count()<<"\n\n";

    cout<<"Return value of peep is : "<<sobj->peep()<<"\n";

    sobj->Display();
    cout<<"Number of elements in Stack are: "<<sobj->Count()<<"\n\n";

    cout<<"Poped element is: "<<sobj->pop()<<"\n";

    sobj->Display();
    cout<<"Number of elements in Stack are: "<<sobj->Count()<<"\n\n";

    cout<<"Poped element is: "<<sobj->pop()<<"\n";

    sobj->Display();
    cout<<"Number of elements in Stack are: "<<sobj->Count()<<"\n\n";

    sobj->push('O');
    cout<<"Pushed element: O\n";
    sobj->Display();
    cout<<"Number of elements in Stack are: "<<sobj->Count()<<"\n\n";

    delete sobj;
}