Lab Cycle 2 — Stack & Queue

#include <iostream>
using namespace std;
#define MAX 5

int queue[MAX], front = -1, rear = -1;

void enqueue(int val) {
    if (rear == MAX-1) { cout << "Queue Full\n"; return; }
    if (front == -1) front = 0;
    queue[++rear] = val;
}

void dequeue() {
    if (front == -1 || front > rear) { cout << "Queue Empty\n"; return; }
    cout << "Dequeued: " << queue[front++] << endl;
}

void display() {
    for (int i = front; i <= rear; i++) cout << queue[i] << " ";
    cout << endl;
}

int main() {
    enqueue(10); enqueue(20); enqueue(30);
    display();
    dequeue();
    display();
    return 0;
}