Wednesday, January 16, 2008

Deleting last but one node in Single Linked List

void DeleteLastButOneNode(Node ** head)
{
Node * temp = *head;
while(temp->next->next != NULL)
temp = temp->next;
temp->num = temp->next->num;
free (temp->next);
temp->next = NULL;
}


Complexity: SIMPLE.

No comments: