# Move first element to end of a given Linked List in C++

<

Given a linked list, we have to move the first element to the end. Let's see an example.

Input

1 -> 2 -> 3 -> 4 -> 5 -> NULL

Output

2 -> 3 -> 4 -> 5 -> 1 -> NULL


## Algorithm

• Return if the linked list is empty or it has single node.
• Find the last node of the linked list.

• Make the second node as the new head.

• Update the links of first and last nodes.

## Implementation

Following is the implementation of the above algorithm in C++

#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
struct Node* next;
};
return;
}
while (lastNode->next != NULL) {
lastNode = lastNode->next;
}
firstNode->next = NULL;
lastNode->next = firstNode;
}
struct Node* newNode = new Node;
newNode->data = new_data;
}
while (node != NULL) {
cout << node->data << "->";
node = node->next;
}
cout << "NULL" << endl;
}
int main() {
return 0;
}

## Output

If you run the above code, then you will get the following result.

8->7->6->5->4->3->2->1->9->NULL

Updated on: 25-Oct-2021

440 Views