LINK LIST

6th Practice (Postest Data Structure)
LINK LIST

#include
#include

using namespace std;

class Node{
friend class List;
friend ostream& operator<<(ostream&, const List&);
public:
Node(char& t, Node* p) : info(t), berikut(p){}
protected:
char info;
Node *berikut;
};

class List{
friend ostream& operator<<(ostream&, const List&);
public:
List() : kepala(0){}
~List();
void sisip(char t);
int hapus(char& t);
int kosong() {return (kepala == 0);}
void cetak();
protected:
Node* kepala;
Node* nodeBaru(char& t,Node* p)
{ Node* q = new Node(t,p); return q;}
};

ostream& operator<berikut)
out <

info <“;
out <berikut;
delete temp;
}
}

void List::sisip(char t)
{
cout << "data "<< t <info;
Node* p = kepala;
kepala = kepala->berikut;
delete p;
return 1;
}

void List::cetak()
{
for (Node* p = kepala; p; p=p->berikut)
cout <

info <“;
cout << "*\n";
}

int main(int argc, char *argv[])
{
List 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<4; i++){
x.hapus(data);
cout << data << " dihapus dari list :";
cout << x;
}
system("PAUSE");
return EXIT_SUCCESS;
}