#include #include struct Node { int data; struct Node *next; }; struct Node *createNode(int value) { struct Node *newNode = (struct Node *)malloc(sizeof(struct Node)); newNode->data = value; newNode->next = NULL; return newNode; } void insertAtHead(struct Node **head, int value) { struct Node *newNode = createNode(value); newNode->next = *head; *head = newNode; } void insertAtEnd(struct Node **head, int value) { struct Node *newNode = createNode(value); if (*head == NULL) { *head = newNode; return; } struct Node *temp = *head; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; } void printList(struct Node *head) { struct Node *temp = head; while (temp != NULL) { printf("%d -> ", temp->data); temp = temp->next; } printf("NULL\n"); } void freeList(struct Node *head) { struct Node *temp; while (head != NULL) { temp = head; head = head->next; free(temp); } } int main() { struct Node *head = NULL; insertAtEnd(&head, 10); insertAtEnd(&head, 20); insertAtHead(&head, 5); insertAtEnd(&head, 30); printList(head); freeList(head); return 0; }