--- In [email protected], Mickey Mathieson <[EMAIL PROTECTED]> wrote: > > You might consider altering your function to return > the value of the NEW first node. > > ENTRY* delete_first_node(struct ENTRY *llist) > { > struct ENTRY *temp; > struct ENTRY *first; > > temp = llist; > first = llist -> next; > delete temp; > return(first); > }
Just nitpicking, but do you need temp?
first = llist->next;
delete llist;
return first;
