Explain why, in the linked implementation of a stack, it is not necessary to implement the operation to determine whether the stack is full.
Description
1. Explain why, in the linked implementation of a stack, it is not necessary to implement the operation to determine whether the stack is full.
2. Suppose that stack is an object of type linkedStackType. What is the difference between the statements stack.top(); and stack.pop();?
3. Write the definition of the function template printListReverse that uses a stack to print a linked list in reverse order. Assume that this function is a member of the class linkedListType.