Stack Implementation using doubly linked list

Author: MohammadFahad1

stack_using_doubly_linked_list.cpp

@@ -0,0 +1,92 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    int val;
+    Node *prev;
+    Node *next;
+    Node(int val)
+    {
+        this->val = val;
+        this->prev = NULL;
+        this->next = NULL;
+    }
+};
+
+class myStack
+{
+public:
+    Node *head = NULL;
+    Node *tail = NULL;
+    int sz = 0;
+
+    void push(int val)
+    {
+        sz++;
+        Node *newNode = new Node(val);
+        if (head == NULL)
+        {
+            head = newNode;
+            tail = newNode;
+            return;
+        }
+        tail->next = newNode;
+        newNode->prev = tail;
+        tail = newNode;
+    }
+
+    void pop()
+    {
+        if (tail == NULL)
+            return;
+        Node *deleteNode = tail;
+        tail = tail->prev;
+        if (tail == NULL)
+            head = NULL;
+        else
+            tail->next = NULL;
+        delete deleteNode;
+        sz--;
+    }
+
+    int top()
+    {
+        return tail->val;
+    }
+
+    int size()
+    {
+        return sz;
+    }
+
+    bool empty()
+    {
+        if (sz == 0)
+            return true;
+        else
+            return false;
+    }
+};
+
+int main()
+{
+    myStack st;
+    int n;
+    cin >> n;
+    for (int i = 0; i < n; i++)
+    {
+        int x;
+        cin >> x;
+        st.push(x);
+    }
+
+    while (!st.empty())
+    {
+        cout << st.top() << endl;
+        st.pop();
+    }
+
+    return 0;
+}