Link list v2 C++

#include <cstdlib>
#include <iostream>

using namespace std;
template <class T>
class Node {
friend class List<T>;
friend ostream& operator<<(ostream&, const List<T>&);
public :
protected :
T info;
Node *berikut;
};
template <class T>
class List {
friend ostream& operator<<(ostream&, const List<T>&);
public :
List() : kepala(0) { }
~List();
void sisip(T t);

int hapus(T& t);
int kosong() { return (kepala == 0); }

void cetak();
Node(T& t, Node<T>* p) : info(t), berikut(p) { }
protected:
Node<T>* kepala;
Node<T>* nodeBaru(T& t, Node<T>* p)
{ Node<T>* q = new Node<T>(t,p); return q; }
};
template <class T>
ostream& operator<<(ostream& out, const List<T>& k) {
for (Node<T>* p = k.kepala; p; p=p->berikut)
out << p->info << " -> ";
out << "*\n";
return out;
}
template <class T>
List<T>::~List() {
Node<T>* temp;
for (Node<T>* p = kepala; p;)
{
temp = p;
p = p->berikut;
delete temp;
}
}
template <class T>
void List<T>::sisip(T t)
{ cout << t << " masuk list : ";
Node<T>* p = nodeBaru(t,kepala);
kepala = p;
}
template <class T>
int List<T>::hapus(T& t)
{
if (kosong()) return 0;     // penghapusan gagal
t = kepala->info;
Node<T>* p = kepala;
kepala = kepala->berikut;
delete p;
return 1;                      // penghapusan sukses
}
template <class T>
void List<T>::cetak()
{
for (Node<T>* p = kepala; p; p=p->berikut)
cout << p->info << " -> ";
cout << "*\n";
}
int main(int argc, char *argv[])
{
    List<char> x;
char data;
x.sisip('a');
cout << x;
x.sisip('b');
cout << x;
x.sisip('c');
cout << x;
x.sisip('d');
cout << x;
for (int i=0; i<5; i++) {
x.hapus(data); cout << data << " dihapus dari list : ";
cout << x;
}
    system("PAUSE");
    return EXIT_SUCCESS;
}