CS202
6- ‹#›
Destructor, Insertion
list::~list() {
node * current;
while (head) {
current = head->next;
delete head; //what does this do?
head = current;
}
ptr = tail = NULL;
}
n
ostream & operator
<< (ostream & out, const list & l) {
node * current = l.head; //how can it access head?
while (current) {
out <<current->obj <<‘
‘; //what does this do?
current = current->next;
}
return out;
}