Singly Linked list deletion

data_structures/linked_list/singly_link_list_deletion.c

@@ -0,0 +1,67 @@
+/*Includes structure for a node which can be use to make new nodes of the Linked List.
+  It is assumed that the data in nodes will be an integer, though
+  function can be modified according to the data type, easily.
+  deleteNode deletes a node when passed with a key of the node.
+*/
+#include <stdio.h>
+#include <stdlib.h>
+
+struct Node
+{
+    int data;
+    struct Node *next;
+};
+
+void push(struct Node** head_ref, int new_data)
+{
+    struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));
+    new_node->data  = new_data;
+    new_node->next = (*head_ref);
+    (*head_ref)    = new_node;
+}
+
+void deleteNode(struct Node **head_ref, int key)
+{
+    struct Node* temp = *head_ref, *prev;
+
+    if (temp != NULL && temp->data == key)
+    {
+        *head_ref = temp->next;
+        free(temp);
+        return;
+    }
+
+
+    while (temp != NULL && temp->data != key)
+    {
+        prev = temp;
+        temp = temp->next;
+    }
+
+    if (temp == NULL) return;
+
+    prev->next = temp->next;
+
+    free(temp);
+}
+
+void printList(struct Node *node)
+{
+    while (node != NULL)
+    {
+        printf(" %d ", node->data);
+        node = node->next;
+    }
+}
+
+int main()
+{
+    /* new node can be created here as :-
+    struct Node* head = NULL;
+    push(&head, data);
+
+    and a node can be delete by using
+    deleteNode(&head, key);
+    */
+    return 0;
+}