structures/linked lists

[xddxogm3]

Can you delete an intire node that is a structure record, or do you have to delete each individual piece of data?

linklist::~linklist()
{
    link *current;
	current = head->next;
	while (current != NULL)  
		  {
                x++;
		   cout << "delete node " << head->link[x] << endl;
		   delete head;
		   head = current;
		   current = current->next;
		  }
	cout << "Deleting last node " << head->link[x] << endl;
	delete head;
}

I declared link as a structure storing names and personal data. It doesn't like the fact that I attempt to delete an entire record at once. As far as what I've learned in class up to this point is that a node can contain any object you want. So if I can delete data in a node, why can I not delete an entire record? I get the below error when trying to compile.

(43): error C2273: 'function-style cast' : illegal as right side of '->' operator

[JaWiB]

 cout << "delete node " << head->link[x] << endl;

So you have a type link and you also have an array of something named link inside your list?
What you seem to be doing is something like this:

int int[10];
cout<<int[1];

I think you have a problem with your logic?

[xddxogm3]

It is more like a structure record.

e.g. link[x].fname;

Instead of deleting each individual peice of data I want to kill the node and the structure record with...

delete link[x];

or in this instance since head is pointing to link[x] the record, I would just delete head.

[Edit]
Does anybody have a syntax example of adding an entire structure record to a node?
[\Edit]

[Sebastiani]

You have to delete everything yourself. That being said, I didn;t really try to 'grok' your data structure so I won't be too specific. The most common approach to automating it is by using containers that delete their internal data when they themselves are being destroyed. This ensures that however far up the chain something is deleted, everything else gets taken care of as well.

[xddxogm3]

Do you mean I will have to create the new node and input each individual piece of data in to the node and to delete each individual piece of data as well.

And I'm deducting that I can not input data into my structure first and then input each individual record into seperate nodes.

So can I have multple peices of data in one node?

 
		link* newlink = new link;  //create node and points newlink to new node        
		newlink->fname = fname;         //puts name into data field    
		newlink->lname = lname;
		newlink->next = head;	//gives new node null or addy to next node

[Edit]
I guess my real question would be can I have a pointer for the new node point at multiple locations, or like what was mentioned before how would I create a container that would encapsulate multiple iteams of data for a linked node?
(e.g. membership registry: first name, last name, ssnumber, etc.)
Why can I not use a structure record as a container?
[/Edit]