void
searchmid(node
*
head,node
*
mid ) { node
*
temp
=
head;
while (head -> next -> next != NULL) { head = head -> next -> next;
mid = temp;
temp -> temp -> next;
}
}
while (head -> next -> next != NULL) { head = head -> next -> next;
mid = temp;
temp -> temp -> next;
}
}