C++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 linkedStackType that returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator. Write a program to test the various functions and operators of the class linkedStackType. InstructionsInstructionsTwo stacks of the same type are the same if they have thesame number of elements and their elements at thecorresponding positions are the same.Overload the relational operator == for the classlinkedStackType that returns true if two stacks of thesame type are the same; it returns false otherwise.Also, write the definition of the function template to overloadthis operator.Write a program to test the various functions and operatorsof the class linkedStackType.GradingWhen you have completed your program, click the Submitbutton to record your score.linkedStack.h12 //Header File: linkedStack.h34 #ifndef H_StackType5 #define H_StackType67 #include 8 #include 910 #include "stackADT.h"1112 using namespace std;1314 //Definition of the node15 template 16 struct node Type17 {181920 };213233343536373839404142434445464748495051525354555657585960616263646566676822 template 23 class linkedStackType: public stackADT24 {25 public:26272829303169 70 71 7291 }92Type info;node Type *link;const linkedStackType& operator=////Overload the assignment operator.bool isEmptyStack() const;//Function to determine whether the stack is empty.//Postcondition: Returns true if the stack is empty;otherwise returns false.139140main.cpp//bool is FullStack() const;//Function to determine whether the stack is full.//Postcondition: Returns false.void initializeStack();//Function to initialize the stack to an empty state.//Postcondition: The stack elements are removed;stackTop = nullptr;//169void push(const Type& newItem);//Function to add newItem to the stack.//Precondition: The stack exists and is not full.//Postcondition: The stack is changed and newItemis added to the top of the stack.////170171172173174175176177178179180181182183184185186187188189190191192193194195196Type top() const;//Function to return the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: If the stack is empty, the programterminates; otherwise, the topelement of the stack is returned.//7374757677 private:78798081828384 };85void pop();//Function to remove the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: The stack is changed and the topelement is removed from the stack.linkedStackType();//Default constructor//Postcondition: stackTop = nullptr;-linkedStackType();//Destructor//Postcondition:linkedStackType (const linkedStackType& otherStack);//Copy constructor//All the elements of the stack areremoved from the stack.bool operator==(const linkedStackType& otherStack) const;//8687 template 88 linkedStack Type ::linkedStackType()89 {90nodeType *stackTop; //pointer to the stackvoid copyStack (const linkedStackType& otherStack);//Function to make a copy of otherStack.//Default constructor{//Postcondition: A copy of otherStack is created andassigned to this stack.stackTop = nullptr;93 template 94 bool linkedStackType::isEmptyStack() const95 {9697}//end isEmptyStackstackADT.h(const linkedStackType&);return false;103}//end isFullStackreturn (stack Top == nullptr);9899 template 100 bool linkedStackType :: isFullStack() const101 {102104105 template 106 void linked StackType::initializeStack()107 {108 nodeType *temp; //pointer to delete the node109110111112113114115116117118 }119} //end initializeStack120while (stackTop != nullptr) //while there are elements in//the stack132}//end pushtemp stackTop;delete temp;121 template 122 void linkedStackType::push(const Type& newElement)123 {124125126127128129130131//set temp to point to the//current nodestackTop = stackTop->link; //advance stackTop to the133134135 template 136 Type linked StackType::top() const137 {138141}//end top+nodeType *newNode; //pointer to create the new nodenewNode = new nodeType; //create the nodenewNode->info = newElement; //store newElement in the nodenewNode->link = stackTop; //insert newNode before stackTopstackTop newNode;//set stackTop to point to the//top node}elsereturn stackTop->info;142143 template 144 void linkedStackType : :pop()145 {146147148149150151152153154155156157158 }//end popassert (stack Top != nullptr); //if stack is empty,//terminate the program//return the top element//next node//deallocate memory occupied by tempelse{nodeType *temp; //pointer to deallocate memoryif (stackTop != nullptr){temp = stackTop; //set temp to point to the top nodestackTop stackTop->link; //advance stackTop to the//next nodedelete temp; //delete the top node159160 template 161 void linkedStackType::copyStack162163 {164 nodeType *newNode, *current, *last;165166167168cout << "Cannot remove from an empty stack." << endl;if (stackTop != nullptr) //if stack is nonempty, make it emptyinitializeStack();if (otherStack.stackTop == nullptr)stackTop = nullptr;(const linkedStackType& otherStack)current = otherStack.stackTop; //set current to point//to the stack to be copied.//copy the stackTop element of the stackstackTop = new node Type; //create the nodelast stack Top;current current->link;stackTop->info = current->info; //copy the infostackTop->link = nullptr; //set the link field of the}//end while//copy the remaining stackwhile (current != nullptr){}//end else197}//end copyStack//node to nullptr//set last to point to the node//set current to point to//the next nodenewNode = new nodeType ;newNode->info = current->info;newNode->link = nullptr;last->link = newNode;last = newNode;current current->link;198199//copy constructor200 template 201 linkedStackType ::linkedStackType(202203 {const linkedStackType& otherStack)linkedStack.h1 #include 2 #include "linkedStack.h"34 using namespace std;56 int main() {789}10main.cpp// Write your main herereturn 0;204 stackTop = nullptr;205 copyStack(otherStack);206 }//end copy constructor207208 //destructor209 template 210 linkedStack Type ::~linkedStackType()211 {initializeStack();212213 }//end destructor214stackADT.h215 //overloading the assignment operator216 template 217 const linkedStackType& linkedStackType::operator=218(const linkedStackType& otherStack)219 {220 if (this ! &otherStack) //avoid self-copy221copyStack (otherStack);222223return *this;224 }//end operator=225226 #endif227+linkedStack.h12 //Header file: stackADT.h34 #ifndef H_StackADT5 #define H_StackADT67 template 8 class stackADT9 {10 public:11121314151617181920212223242526272829303132333434353637383940414243 };virtual void initializeStack() = 0;//Method to initialize the stack to an empty state.//Postcondition: Stack is empty.//virtual bool isEmptyStack() const = 0;//Function to determine whether the stack is empty.//Postcondition: Returns true if the stack is empty,otherwise returns false.main.cpp//virtual bool is FullStack() const = 0;//Function to determine whether the stack is full.//Postcondition: Returns true if the stack is full,otherwise returns false.stackADT.h//+virtual void push(const Type& newItem) = 0;//Function to add newItem to the stack.//Precondition: The stack exists and is not full.//Postcondition: The stack is changed and newItemis added to the top of the stack.////4445 #endif46virtual Type top() const = 0;//Function to return the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: If the stack is empty, the program//Postcondition: If the stack is empty, the programterminates; otherwise, the top elementof the stack is returned.//virtual void pop() = 0;//Function to remove the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: The stack is changed and the topelement is removed from the stack.

C++ is an object oriented programming languages. It is used to create the web applications and also…

Answered: C++ Two stacks of the same type are…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks