Implement a class stack which simulates the operations of the stack allowing LIFO operationsAlso implement push and pop operations for the stack?

Answer 1

/* C program to implement stack. Stack is a LIFO data strcuture LIFO - Last in First Out Perform PUSH(insert operation), POP(Delete operation) and Display stack */

#include

#include

#define MAXSIZE 5

struct stack /* Structure definition for stack */

{

int stk[MAXSIZE];

int top;

};

typedef struct stack STACK;

STACK s;

/* Function declaration/Prototype*/

void push (void);

int pop(void);

void display (void);

void main ()

{

int choice;

int option = 1;

clrscr ();

s.top = -1;

printf ("STACK OPERATION\n");

while (option)

{

printf ("--------------\n");

printf (" 1 -> PUSH \n");

printf (" 2 -> POP \n");

printf (" 3 -> DISPLAY \n");

printf (" 4 -> EXIT \n");

printf ("--------------\n");

printf ("Enter your choice\n");

scanf ("%d", &choice);

switch (choice)

{

case 1: push();

break;

case 2: pop();

break;

case 3: display();

break;

case 4: return;

}

fflush (stdin);

printf ("Do you want to continue(Type 0 or 1)?\n");

scanf ("%d", &option);

}

}

/*Function to add an element to the stack*/

void push ()

{

int num;

if (s.top -1)

{

printf ("Stack is empty\n");

return;

}

else

{

printf ("\nThe status of the stack is\n");

for (i = s.top; i >= 0; i-)

{

printf ("%d\n", s.stk[i]);

}

}

printf ("\n");

}

by

ankit shukla