Question

C++

Please ensure code is fully working, will rate

Question to be answered:

   Repeat Exercise 1 for the class linkedStackType

question one:

       Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class stackType that returns true if two stacks of the same type are the same, false otherwise. Also, write the definition of the function template to overload this operator.

Code from Q1 build if needed

#include
#include
#include
using namespace std;
template
class stackType
{
private:
int maxStackSize; //variable to store the maximum stack size
int stackTop; //variable to point to the top of the stack

T *array; //pointer to the array that holds the stack elements
public:
//determines whether the stack is empty
bool isEmpty()
{
return(stackTop == 0);
}
//determines whether the stack is full
bool isFull()
{
return(stackTop == maxStackSize);
}

//adds newItem to the stack
void push(const T& newItem)
{
if (!isFull())
{
//adds newItem to the top of the stack
array[stackTop] = newItem;
stackTop++; //increment stackTop
}
else
cout << "Cannot add to a full stack." << endl;
}

//returns the top element of the stack
T top()
{
//if stack is empty terminate the program
assert(stackTop != 0);
//return the element of the stack indicated by stackTop - 1   
return array[stackTop - 1];
}

//removes the top element of the stack
void pop()
{
if (!isEmpty())
stackTop--; //decrement stackTop
else
cout << "Cannot remove from an empty stack." << endl;
}
//gets the stack size
int size()
{
return stackTop;
}
//constructor
//Creates an array of the size stackSize to hold
//the stack elements. The default stack size is 50.
stackType(int stackSize = 50)
{
if (stackSize <= 0)
{
cout << "Size of the array must be positive."<< endl;
cout << "Creating an array of size 50." << endl;
maxStackSize = 50;
}
else
maxStackSize = stackSize; //set the stack size
stackTop = 0; //set stackTop to 0
array = new T[maxStackSize]; //create the array
}
};
template
bool operator==(const stackType& firstStack, const stackType& secondStack)
{
stackType stack1, stack2;
stack1 = firstStack;
stack2 = secondStack;
int size1 = stack1.size();
int size2 = stack2.size();
bool isSame = true;
//Check if the two stacks are the same size

if(size1 == size2)
{
for(int i = 0; i < size1; i++)
{
if(stack1.top() != stack2.top())
{
isSame = false;
}
stack1.pop();
stack2.pop();
}
}
else
{
//The stacks are not of same size
isSame = false;
}
return isSame;
}
//main function
int main()
{
stackType firstStack;
stackType secondStack;
firstStack.push(10);
firstStack.push(109);
firstStack.push(28);
firstStack.push(91);
secondStack.push(10);
secondStack.push(109);
secondStack.push(28);
secondStack.push(91);
if(firstStack == secondStack)
{
cout << "The Stacks Are Equal" << endl;
}
else
{
cout << "The Stacks Are NOT Equal" << endl;
}
return 0;
}

Answer 1

#include<iostream>

#include<cstdlib>

#include <assert.h>

using namespace std;

template<class T>

class stackType

{

    private:

       

        int maxStackSize; //variable to store the maximum stack size

        int stackTop; //variable to point to the top of the stack

       

       

        T *array; //pointer to the array that holds the stack elements

       

    public:

       

        //determines whether the stack is empty

        bool isEmpty()

        {

            return(stackTop == 0);

        }

        //determines whether the stack is full

        bool isFull()

        {

            return(stackTop == maxStackSize);

        }

        

        //adds newItem to the stack

        void push(const T& newItem)

        {

            if (!isFull())

            {

                //adds newItem to the top of the stack

                array[stackTop] = newItem;

                stackTop++; //increment stackTop

            }

            else

                cout << "Cannot add to a full stack." << endl;

        }

       

        //returns the top element of the stack

        T top()

        {

            //if stack is empty terminate the program

            assert(stackTop != 0);

           

            //return the element of the stack indicated by stackTop - 1  

            return array[stackTop - 1];

        }

       

        //removes the top element of the stack

        void pop()

        {

            if (!isEmpty())

                stackTop--; //decrement stackTop

            else

                cout << "Cannot remove from an empty stack." << endl;

        }

        //gets the stack size

        int size()

        {

            return stackTop;

        }

        //constructor

        //Creates an array of the size stackSize to hold

        //the stack elements. The default stack size is 50.

        stackType(int stackSize = 50)

        {

            if (stackSize <= 0)

            {

                cout << "Size of the array must be positive."<< endl;

                cout << "Creating an array of size 50." << endl;

                maxStackSize = 50;

            }

            else

                maxStackSize = stackSize; //set the stack size

           

            stackTop = 0; //set stackTop to 0

            array = new T[maxStackSize]; //create the array

        }

};

template<class T>

bool operator==(const stackType<T>& firstStack, const stackType<T>& secondStack)

{

    stackType<T> stack1, stack2;

    stack1 = firstStack;

    stack2 = secondStack;

    int size1 = stack1.size();

    int size2 = stack2.size();

    bool isSame = true;

    //Check if the two stacks are the same size

   

    if(size1 == size2)

    {

        for(int i = 0; i < size1; i++)

        {

            if(stack1.top() != stack2.top())

            {

                isSame = false;

            }

           

            stack1.pop();

            stack2.pop();

        }

  }

    else

    {

        //The stacks are not of same size

        isSame = false;

    }

   

    return isSame;

}

//main function

int main()

{

    stackType<int> firstStack;

    stackType<int> secondStack;

    firstStack.push(10);

    firstStack.push(109);

    firstStack.push(28);

    firstStack.push(91);

    secondStack.push(10);

    secondStack.push(109);

    secondStack.push(28);

    secondStack.push(91);

   

    if(firstStack == secondStack)

    {

        cout << "The Stacks Are Equal" << endl;

  }

    else

    {

        cout << "The Stacks Are NOT Equal" << endl;

    }

    return 0;

}

Sample Output