Implement a template-based stack using a singly linked list. The required member methods are: int size(): returns the count of total element stored in the stack. bool isEmpty(): returns true if the ...

You can create a stack using a linked list by using one of the ends of the list as the top of the stack. For example, you can use the head node as the top, and insert or delete nodes at the head.

both the stack and linked list is coded to just use integers. the linked list functions include: push_front, • push_back, • pop_front, • pop_back, • front, back, • empty, • void insert(int index, int ...