Question

Write a program to implement the IntStack that stores a static stack of integers and performs the pop, push, isFull, and isEmpty operations. Write the main class to create a static stack of numbers 10, 20, 30, 40, and 50 then try the member functions.

C++

Answer 1

source code:

#include <bits/stdc++.h>

using namespace std;

#define MAX 1000

class Stack {
   int top;

public:
   int a[MAX]; // Maximum size of Stack

   Stack() { top = -1; }
   bool push(int x);
   int pop();
   int peek();
   bool isEmpty();
};

bool Stack::push(int x)
{
   if (top >= (MAX - 1)) {
       cout << "Stack Overflow";
       return false;
   }
   else {
       a[++top] = x;
       cout << x << " pushed into stack\n";
       return true;
   }
}

int Stack::pop()
{
   if (top < 0) {
       cout << "Stack Underflow";
       return 0;
   }
   else {
       int x = a[top--];
       return x;
   }
}
int Stack::peek()
{
   if (top < 0) {
       cout << "Stack is Empty";
       return 0;
   }
   else {
       int x = a[top];
       return x;
   }
}

bool Stack::isEmpty()
{
   return (top < 0);
}

// Driver program to test above functions
int main()
{
   class Stack s;
   s.push(10);
   s.push(20);
   s.push(30);
   s.push(40);
   s.push(50);

   cout << s.pop() << " Popped from stack\n";

   return 0;
}