Reversing single Linked list

//reverse of the single linked list
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
template<class T>
class sll;
template<class T>
class node
{
 private:
  T data;
  node<T>* link;
 friend class sll<T>;
};//end of node class
template <class T>
class sll
{
 private:
  node<T> * first;
 public:
 //Mem.Fun declarations
  sll();

  int isempty();
  void display();
 

  void append(node<T> *k);
  void create();
  void reverse();

};//end of sll class
//Member Functions defination
template<class T>
sll<T>::sll()
{
 first=NULL;//first points to no where,it is an empty node
}
template<class T>
int sll<T>::isempty()
{
 return(first==NULL);//return true when linked list is empty and false otherwise
}
template<class T>
void sll<T>::display()
{
 node<T>* p;//p is pointer to a node
 if(isempty())
  cout<<"Linked List is empty\n";
 else
 {
  cout<<"Linked list is as follows\n";
  p=first;
  while(p!=NULL)
  {
   cout<<p->data<<"\t"<<p->link<<"\n";
   p=p->link;
  }
 }//end of else
}
//end of display()

template<class T>
void sll<T>::append(node<T> *k)
{
 node<T> *last;
 k->link=NULL;
 if(isempty())
  first=k;
 else
 {
  last=first;
  while(last->link!=NULL)//keep moving last pointer until last node is reached
  {
   last=last->link;
  }
  last->link=k;//attach last node and new node k
 }
}
template <class T>
void sll<T>::create()
{
 T x;
 node<T> *k;
 first=NULL;
 cout<<"enter values terminated by -1 or !\n";
 cin>>x;
 while(x!=-1&&x!='!')
 {
  k=new node<T>;
  k->data=x;
  append(k);
  cin>>x;
 }
}//end of create()

//function for reverse of a single linked list
template<class T>
void sll<T>::reverse()
{
 node<T> *cur,*prev,*next;
 next=first;
 cur=NULL;
 while(next!=NULL)
 {
  prev=cur;
  cur=next;
  next=next->link;
  cur->link=prev;
 }
 first=cur;
}//end of reverse()


void main()
{
 sll<int> a;//creating object a, d.c is called
 node<int> *p;
 int x,i;
 clrscr();
 a.create();
 clrscr();
 cout<<"Before reverseing\n";
  a.display();
 cout<<"After reverseing\n";
 a.reverse();
 a.display();
 getch();
}

Single Linked List 

Singly Linked List Operations