swap two node

1// Your code here
2#include <iostream>
3 
4struct Node {
5    int data;
6    Node* next;
7    Node(int val) : data(val), next(nullptr) {}
8};
9 
10// Function to swap nodes with values x and y
11void swapNodes(Node*& head, int x, int y) {
12    // Nothing to do if values are the same
13    if (x == y) return;
14 
15    Node *prevX = nullptr, *currX = head;
16    while (currX && currX->data != x) {
17        prevX = currX;
18        currX = currX->next;
19    }
20 
21    Node *prevY = nullptr, *currY = head;
22    while (currY && currY->data != y) {
23        prevY = currY;
24        currY = currY->next;
25    }
26 
27    // If either x or y is not present, nothing to do
28    if (!currX || !currY) return;
29 
30    // If x is not head of linked list, make prevX point to y
31    if (prevX != nullptr)
32        prevX->next = currY;
33    else // Else make y the new head
34        head = currY;
35 
36    // If y is not head of linked list, make prevY point to x
37    if (prevY != nullptr)
38        prevY->next = currX;
39    else // Else make x the new head
40        head = currX;
41 
42    // Swap next pointers of x and y
43    Node* temp = currY->next;
44    currY->next = currX->next;
45    currX->next = temp;
46}