Stack

Question 1

Stack push

Answer 1

void push(T value)
{
    if (isFull())
    {
        cout << "Stack is already full" << endl;
        return;
    }
    topIndex++;
    stack[topIndex] = value;
}

Question 2

Stack pop

Answer 2

    void pop()
    {
        if (isEmpty())
        {
            cout << "Stack is already empty" << endl;
            return;
        }
        topIndex--;
    }

Question 3

Stack top/peek

Answer 3

    T top() const
    {
        if (isEmpty())
        {
            cout << "Stack is empty" << endl;
            return T();
        }
        return stack[topIndex];
    }

Question 4

Stack isEmpty

Answer 4

    bool isEmpty() const
		{
               return topIndex == -1;
    }

Question 5

Stack isFull

Answer 5

bool isFull() const
{
                return topIndex == MAXSIZE - 1;
 }

Question 6

Stack clear

Answer 6

    void clear()
		{
                            topIndex = -1;
       }

Question 7

Stack display

Answer 7

template <typename T>
void display(const Stack<T>& s)
{
    if (s.isEmpty()) {
        cout << "Stack is empty" << endl;
        return;
    }

    Stack<T> temp = s;
    while (!temp.isEmpty()) {
        cout << temp.top() << " ";
        temp.pop();
    }
    cout << endl;
}