i'm hoping i'm wrong here but to delete a linked list you have to make a delete command on each the pointer for each node yes?
so does that mean that to fully delete a linked list you actually need to have stored somehow the pointers for the node that comes above the node your deleting (if you start at the last node, the 'bottom' of the list) or does anyone know a better way i'm not thinking of?
