Understanding deletion of first node

Deleting the first node is similar to inserting at the beginning and is also one of the simplest deletion operations. We need to consider two cases.

1. The list is empty

When the list is empty, meaning it contains no elements, any attempt to delete a node is unnecessary because there are no nodes in the list. Since there is nothing to remove, the list remains unchanged. We can return the existing head, as the list is empty, and no node needs to be deleted.