# Append the last n nodes of a linked list to the beginning of the list

## Java program to append last n nodes to the beginning

Java program to append last n nodes to the beginning of the Linked List. Last n nodes of the linked list will be placed in the beginning of the list.

Example:
Input : 10–>20–>30–>40–>50–>60
n=3
Output: 40–>50–>60–>10–>20–>30 ## Algorithm to append last n nodes to the beginning

1. Find (n+1)th node from the end of linked list. It will be the tail of modified linked list.
2. Find nth node from the beginning of linked list. It will be the head of modified linked list.
3. Set the next of (n+1)th node as null.
4. Point the next of the tail of original linked list to head of original linked list.

### Example

```Input : 10-->20-->30-->40-->50-->60
n=3
Output: 40-->50-->60-->10-->20-->30``` ## Code in JAVA Programming Language

Run
```import java.util.*;

public class Main
{

public static void main (String[]args) throws Exception
{

ll.display ();

ll.appendToFront (3);

ll.display ();
}

}

{
private class Node
{
int data;
Node next;

// Node constructor
// There are two fields in the node- data and address of next node
public Node (int data, Node next)
{
this.data = data;
this.next = next;
}
}

private Node tail;
private int size;

{
this.tail = null;
this.size = 0;

}

// Function to find the size of linked list
public int size ()
{
return this.size;
}

// Function to check whether linked list is empty or not
public boolean isEmpty ()
{
return this.size () == 0;
}

// Function to traverse and print the linked list
public void display ()
{
while (temp != null)
{
System.out.print (temp.data + ">");
// Set temp to point to the next node
temp = temp.next;
}
System.out.println ("END");
}

{
// Create a temp node which points to head
Node temp = new Node (item, head);

// If linked list is empty, temp is the head and tail node both
if (this.size == 0)
{
}

// else set the head such that it now points to temp node
else
{

}

this.size++;
}

public int kthFromLast (int k)
{
return this.kthNodeFromLast (k).data;

}

// Function to find kth node from last
private Node kthNodeFromLast (int k)
{

// Take slow and fast pointers

// First move fast pointer k nodes from the head
for (int i = 0; i < k; i++)
{
fast = fast.next;
}

// Move both slow and fast by one till fast becomes null
while (fast != null)
{
fast = fast.next;
slow = slow.next;

}

// Slow pointer points to the nth node from last
return slow;
}

public void appendToFront (int n)
{

// Find (n+1)th node from last
Node np1 = this.kthNodeFromLast (n + 1);

// Find the nth node from beginning
Node nth = np1.next;

// Set the pointers of node
np1.next = null;

this.tail = np1;
}
}
```
```Output:
10–>20–>30–>40–>50–>60–>END
40–>50–>60–>10–>20–>30–>END
```

### Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

## Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

## Checkout list of all the video courses in PrepInsta Prime Subscription

• Introduction to Linked List in Data Structure
C | C++ | Java
• Singly Linked List in –
C | C++ | Java
• Insertion in singly Linked List –
C | C++ | Java
• Insertion at beginning in singly Linked List  –
C | C++Java
• Insertion at nth position in singly Linked List  –
C | C++Java
• Insertion at end in singly Linked List  –
C | C++Java
• Deletion in singly Linked List  –
C | C++Java
• Deletion from beginning in singly linked list :
C | C++ | Java
• Deletion from nth position in singly linked list :
C | C++ | Java
• Deletion from end in singly linked list :
C | C++ | Java
• Linked List Insertion and Deletion –
C | C++Java
• Reverse a linked list without changing links between nodes (Data reverse only) –
C | C++Java
C | C++Java
• Print reverse of a linked list without actually reversing –
C |C++Java
• Print reverse of a linked list without actually reversing –
C |C++Java
• Insertion in the middle Singly Linked List –
C | C++Java
• Insertion in a Sorted Linked List –
C | C++Java
• Delete alternate nodes of a Linked List –
C | C++Java
• Find middle of the linked list –
C | C++Java
• Reverse a linked list in groups of given size –
C | C++Java
• Find kth node from end of the linked list –
C | C++Java
• Append the last n nodes of a linked list to the beginning of the list –
C | C++Java
• Check whether linked list is palindrome or not –
C | C++Java
• Fold a Linked List –
C | C++Java
• Insert at given Position –
C | C++Java
• Deletion at given Position –
C | C++Java

• Introduction to Linked List in Data Structure
• Linked List in – C | C++ | Java
• Singly Linked List in – C | C++ | Java
• Insertion in singly Linked List – C | C++ | Java
• Insertion at beginning in singly Linked List  – C | C++Java
• Insertion at nth position in singly Linked List  – C | C++Java
• Insertion at end in singly Linked List  – C | C++Java
• Deletion in singly Linked List  – C | C++Java
• Deletion from beginning in singly linked list : C | C++ | Java
• Deletion from nth position in singly linked list : C | C++ | Java
• Deletion from end in singly linked list : C | C++ | Java
• Reverse a linked list without changing links between nodes (Data reverse only) – C | C++Java
• Linked List Insertion and Deletion – C | C++Java
• Reverse a linked list by changing links between nodes – C | C++Java
• Linked List insertion in the middle – C | C++Java
• Print reverse of a linked list without actually reversing – C |C++Java
• Search an element in a linked list – C | C++Java
• Insertion in a Sorted Linked List – C | C++Java
• Delete alternate nodes of a Linked List – C | C++Java
• Find middle of the linked list – C | C++Java
• Reverse a linked list in groups of given size – C | C++Java
• Find kth node from end of the linked list – C | C++Java
• Append the last n nodes of a linked list to the beginning of the list – C | C++Java
• Check whether linked list is palindrome or not – C | C++Java
• Fold a Linked List – C | C++Java
• Insert at a given position – C | C++Java
• Delete at a given position – C | C++Java