DynamicStack.cpp

#include <iostream>
using namespace std;

struct StackNode
{
    int data;
    StackNode* next;
}*top = NULL;

void push(int value){
    StackNode* newNode = (StackNode*)malloc(sizeof(StackNode));
    newNode->data = value;
    newNode->next = NULL;
    if (top == NULL)
    {
        top = newNode;
        return;
    }
    newNode->next = top;
    top = newNode;
}
void pop(){
    if (top == NULL)
    {
        cout<<"Stack is Empty"<<endl;
        return;
    }
    StackNode* temp = top;
    cout<<top->data;
    top = top->next;
    free(temp);
}
void display(){
    if (top == NULL)
    {
        cout<<"Stack is Empty"<<endl;
        return;
    }
    cout<<"Elements of Stack from top: ";
    StackNode* curr = top;
    while (curr != NULL)
    {
        cout<<curr->data<<" ";
        curr = curr->next;
    }
    cout<<endl;
}
int main()
{
    int choice,value;
    while(true){
        cout<<"1: Push"<<endl;
        cout<<"2: Pop"<<endl;
        cout<<"3: View Elements"<<endl;
        cout<<"4: Exit"<<endl;
        cout<<"Enter which operation would you like to perform : "<<endl;
        cin>>choice;
        switch (choice)
        {
        case 1:
            cout<<"Enter value to be pushed:";
            cin>>value;
            push(value);
            break;
        case 2:
            pop();
            break;
        case 3:
            display();
            break;
        case 4:
            cout<<"Exiting...\n";
            break;
        default:
            break;
        }
        if (choice >= 4)
        {
            break;
        }
    }
    return 0;
}