write a program to implementation of stack using array in data structure.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 |
#include<stdio.h> #include<stdlib.h> #include <dos.> #define SIZE 5 int STACK[SIZE]; int top =1; int main(void) { int option; void push(void); void pop(void); void peek(void); while(1) { system("CLS"); printf("\n PUSH PRESS 1:"); printf("\n POP PRESS 2: "); printf("\n PEEK PRESS 3:"); printf("\nEXIT PRESS $:"); scanf("%d",&option); switch(option) { case 1: push(); break; case 2: pop(); break; case 3: peek(); break; case 4: return EXIT_SUCCESS; default:printf("INVALID OPTION \n"); system("PAUSE"); } } } void puch() { int data; if(top = = SIZE-1) { printf("STACK IS OVERFLOW..!!!"); SYSTEM("pause"); return; } printf("enater data :"); scanf("%d",&data); ++top; STACK[top]=data; } void pop() { if(top = = -1) { printf("Stack is under flow...!!!\n"); system("PAUSE"); return; } printf("POP Element is : %d\n", stack[top]); --top; system("PAUSE"); } void peek() { int i; if(top = = -1) { printf("Stack is empty..!!!\n"); system("PAUSE"); return; } print("STACK ELEMENTS:"); for(i=top;i=0;i--) print("d",STACK[i]); printf("\N"); system("PAUSE"); } |