Question

C++ functions using linked list

A templated stack class that stores type T with the following public functions:

template <class T>

class Stack{

- void Push(T t) - adds t to the top of the stack

- T Pop() - asserts that the stack is not empty then removes and returns the item at the top of the stack.

};

Answer 1

CODE

template <class T>

void Stack::Push(T t)

{

Node<T>* temp;

temp = new Node();

temp->data = data;

temp->next = top;

top = temp;

}

template <class T>

T Stack::pop() {

Node<T* temp;

if (top == NULL) {

cout << "\nStack Underflow" << endl;

exit(1);

}

else {

temp = top;

top = top->next;

temp->next = NULL;

delete temp;

}

}