Question: Write a function named edit which removes the middle node of a 3-node linked list. *This list has no sentinel node!* The Prototype should be:
Write a function named "edit" which removes the middle node of a 3-node linked list.
*This list has no sentinel node!*
The Prototype should be:
void edit(struct node *ptr);

You'1l 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) It should take a linked list as follows: ptr NULLI and remove this node
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
