Question

Simulating a stack of push, pop and peak in C++ using array of 1000.

Answer 1

Here is the c++ code for generic Stack class implementation with push, pop and peak functions:

#include <iostream>

using namespace std;

template <typename T>

class Stack

{

   T *array;

   int stackTop;

   int maxStackSize;

public:

   //default constructor

   Stack()

   

       array = new T[1000];

       stackTop = -1;

       maxStackSize = 1000;

   

   //function to push element to stack

   void push(T input)

   

       stackTop++;

       if (stackTop == maxStackSize)

       

           std::cout << "Stack Overflow!" << std::endl;

           stackTop--;

       

       else

       

           array[stackTop] = input;

       

   

   //function to return top element

   T peak()

   

       if (stackTop == -1)

       

           std::cout << "Stack is empty" << std::endl;

           return -1;

       

       else

       

           return array[stackTop];

       

   

   //function to pop

   void pop()

   

       if (stackTop == -1)

       

           std::cout << "Stack is empty" << std::endl;

       

       else

       

           stackTop--;

       

   

   //function to check is stack is empty

   bool isEmpty()

   

       if (stackTop == -1)

       

           return true;

       

       return false;

   

   //destructor

   ~Stack()

   

       delete[] array;

   

};

//driver function

int main()

{

   Stack<int> s;//object s of type integer Stack

   for (int i = 0; i < 20; i += 2)//push 0, 2, 4, ..., 18 in stack

   

       s.push(i);

   

   while (!s.isEmpty())

   

       cout << s.peak() << endl;

       s.pop();

   

}

Sample output:

T File Edit View Search Terminal Help iunseen@pc]09:04 AM_$ ~/prog/CPP -> ./main EDITORS #include 18 x Cmain.cpp using nam 16 CPP 14 .vscode 12 template DP 10 class Sta 8 ds 6 4 kar graph_algo int s numth int m sort_algo 10 CO O NOL