template <class Type>
class myStack
{
public:
myStack();
myStack(const myStack<Type>&);
const myStack<Type>& operator=(const myStack<Type>&);
~myStack();

void push(const Type&);
void pop();
Type top() const;
bool isEmpty() const;

private:
struct node
{
Type item;
node * next;
};

node * topOfmyStack;
};

template <class Type>
myStack<Type>::myStack()
{
topOfmyStack = NULL;
}

template <class Type>
myStack<Type>::myStack(const myStack<Type>& copy)
{
// if empty, just set top to null
if (copy.isEmpty()) {
topOfmyStack = NULL;
}
// else, do a deep copy
else {
// allocate the first element
topOfmyStack = new node;
topOfmyStack->item = copy.topOfmyStack->item;
// loop until we allocate all the elements from the list
node* tmp = topOfmyStack;
node* tmpc = copy.topOfmyStack;
while (tmpc->next) {
   // allocate memory for a new node and copy the contents
   tmp->next = new node;
   tmp->next->item = tmpc->next->item;
   // update the pointers
   tmpc = tmpc->next;
   tmp = tmp->next;
}
// finally set the next pointer of the last element to null
tmp->next = NULL;
}
}

template<class Type>
const myStack<Type>& myStack<Type>::operator=(const myStack<Type>& rhs)
{
// check for self assignment
if (this != &rhs) {
// first clear the whole stack
node* tmp;
while (topOfmyStack) {
   tmp = topOfmyStack;
   topOfmyStack = topOfmyStack->next;
   delete tmp;
}
// if rhs is empty, just set top to null
if (rhs.isEmpty()) {
   topOfmyStack = NULL;
}
// else, do a deep copy
else {
   // allocate the first element
   topOfmyStack = new node;
   topOfmyStack->item = rhs.topOfmyStack->item;
   // loop until we allocate all the elements from the list
   node* tmp = topOfmyStack;
   node* tmpc = rhs.topOfmyStack;
   while (tmpc->next) {
   // allocate memory for a new node and copy the contents
   tmp->next = new node;
   tmp->next->item = tmpc->next->item;
   // update the pointers
   tmpc = tmpc->next;
   tmp = tmp->next;
   }
   // finally set the next pointer of the last element to null
   tmp->next = NULL;
}
}
return *this;
}

template<class Type>
myStack<Type>::~myStack()
{
// clear the whole stack
node* tmp;
while (topOfmyStack) {
tmp = topOfmyStack;
topOfmyStack = topOfmyStack->next;
delete tmp;
}
}

Assignment 9: New City Description You just got off the phone wit...