stack enqueue code
#include <stdio.h>
#define SIZE 5
int stack[SIZE];
int top = -1;
void enqueue(int value) {
if (top == SIZE - 1) {
printf("Queue is full\n");
} else {
top++;
stack[top] = value;
}
}
void display() {
if (top == -1) {
printf("Queue is empty\n");
} else {
printf("Queue elements are:\n");
for (int i = 0; i <= top; i++) {
printf("%d ", stack[i]);
}
printf("\n");
}
}
int main() {
enqueue(1);
enqueue(2);
enqueue(3);
display();
return 0;
}