Searching the data in the single linked list

//creating and searching the data in 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>;
};
template <class T>
class sll
{
 private:
  node<T> * first;
 public:
 //Mem.Fun declarations
  sll();
  int isempty();

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

};
//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
}

//searching
template<class T>
node<T>* sll<T>::search(T x)
{
 node<T> * p;
 p=first;
 while(p!=NULL)
 {
  if(p->data==x)
   return(p);
  else
   p=p->link;

 }
 return(NULL);
}


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()


void main()
{
 sll<int> a;//creating object a, d.c is called
 node<int> *p;
 int x;
 clrscr();
 a.create();
 cout<<"enter value to be searched\n";
 cin>>x;
 p=a.search(x);
 if(p==NULL)
 {
  cout<<"value is not found in the linked list\n";
 }
 else
 {
  cout<<"value is found at address\t"<<p<<"\n";
 }

 getch();
}

Single Linked List