Does anyone have any ideas on how I would loop that
}while(/*some loop ending condition*/);
If it's a singly linked list, advance two pointers through the list: one pointing to the first node one pointing to the second node. If the leading pointer matches the node you are looking for, use it's next pointer to get the next node and assign the next node to the trailing pointer's next pointer. Then assign 0 to the current node's next pointer.
Does any one know how to delete one record in a linked list??
You'll have to take care of the case when the first node is the one you want to remove, which just involves setting its next pointer to null.