gistfile1.cpp

template <typename T>
void LinkedList<T>::reverseList() {

	ListNode<T> *nodePtr; //to traverse the front
	nodePtr = head->next;

	ListNode<T> *previous;  //to traverse the end
	previous = head;

	ListNode<T> *temp = nodePtr;

	while(temp != NULL) {
		std::cout << temp->value << ", ";

		nodePtr->next = previous;

		temp = temp->next;

	}

	head = temp;
	temp->next = nodePtr;



}