node *find_node (node *head, int data)
for (; head; head=head->next)
if(data == head->data)
try something like this (no null)
// if it is desired node
// break ;
How to find the median of simple linked list and add a node after it? C program would be helpful?
How to delete the node that given as argument in single linked list?
Is there any system call to get prev pointer ?
Note: Here the goal is to delete the address not the node's value