Scribd
Upload
68 views3 pages

P4 LinkedList

The document describes a C program to swap the elements of a singly linked list. The program creates a linked list by appending nodes, then defines a swap function that iterates through the list and swaps the data of each node with the next. It prints the original and swapped lists, and includes functions for creating/freeing nodes and printing the list.

Uploaded by

kunal.bhoi.st
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views3 pages

P4 LinkedList

The document describes a C program to swap the elements of a singly linked list. The program creates a linked list by appending nodes, then defines a swap function that iterates through the list and swaps the data of each node with the next. It prints the original and swapped lists, and includes functions for creating/freeing nodes and printing the list.

Uploaded by

kunal.bhoi.st
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Kunal Shantaram Bhoi

Div – C ( CSE-AIML ) Batch – A


UID : 2022600007

Problem Statement :
For the given singly linked list swap the elements.eg. if the given list is 1 2 3 4 5 then the list will
become 2 1 4 3 5

Program :

#include <stdio.h>
#include <stdlib.h>

struct Node {
int data;
struct Node* next;
};

struct Node* createNode(int data) {


struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}

void append(struct Node** head, int data) {


struct Node* newNode = createNode(data);
if (*head == NULL) {
*head = newNode;
return;
}
struct Node* current = *head;
while (current->next != NULL) {
current = current->next;
}
current->next = newNode;
}

void printList(struct Node* head) {


struct Node* current = head;
while (current != NULL) {
printf("%d -> ", current->data);
current = current->next;
}
printf("NULL\n");
}

void swap(struct Node* head) {


struct Node* current = head;
while (current != NULL && current->next != NULL) {
int temp = current->data;
current->data = current->next->data;
current->next->data = temp;
current = current->next->next;
}
}

void freeList(struct Node* head) {


struct Node* current = head;
while (current != NULL) {
struct Node* temp = current;
current = current->next;
free(temp);
}
}

int main() {
struct Node* head = NULL;
int n;
int data;

printf("Enter number of elemnts : ");


scanf("%d", &n);
printf("Enter LinkedList:\n");
for (int i = 0; i < n; i++){
scanf("%d", &data);
append(&head, data);
}

printf("Original Linked List:\n");


printList(head);

swap(head);

printf("\nLinked List after swapping:\n");


printList(head);

freeList(head);

return 0;
}
Output :

You might also like