Question: you are to write a function named edit which removes the middle node of a 3-node linked list. *********************************** * THIS LIST HAS NO SENTINEL
you are to write a function named "edit" which removes the middle node of a 3-node linked list.
*********************************** * THIS LIST HAS NO SENTINEL NODE! * ***********************************
You'll be given the address of the first data node. Your function should delete the following (second/middle) node.
The prototype for edit is: void edit(struct node *ptr);
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
