Algorithm

In a normal singly linked list, the head node is the entry point of the list. If we need to delete the head, we just need to update the head pointer to point to the next node. The original head node will then be disconnected from the list and can be deleted. This way, the second node becomes the new head of the list.

First, check if the list is empty. If it is, no deletion is possible.
Temporarily keep track of the current first node.
Move the head of the list forward to the second node.
Free or delete the temporarily stored first node.
The list now starts from the second node, thus the first node is effectively deleted.