This is about Data Structure & Algorithms Analysis in C
Linked List ADT. Delete Implement Code below :
void
delete( element_type x, LIST L )
{
position p, tmp_cell;
p = find_previous( x, L );
if( p->next != NULL )
{
tmp_cell = p->next;
p->next = tmp_cell->next;
free( tmp_cell );
}
}
Question 1. Am I thinking right that not executing ‘malloc’ totmp_cell is because we are ‘free’ing tmp_cell so that we do nothave to worry about memory usage ?
Question 2.
tmp_cell = p->next;
p->next = tmp_cell->next;
free( tmp_cell );
can i change the code above to the below one ? (not usingtmp_cell)
if not possible, tell me why i can not change light below.
p->next=p->next->next
Expert Answer
An
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured