Lab Cycle 2 — Stack & Queue

#include <iostream>
using namespace std;

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

void push(int val) {
    Node* newNode = new Node();
    newNode->data = val;
    newNode->next = top;
    top = newNode;
}

void pop() {
    if (top == NULL) { cout << "Stack Empty\n"; return; }
    Node* temp = top;
    top = top->next;
    delete temp;
}

int main() {
    push(10); push(20); push(30);
    pop();
    return 0;
}