Insert a Node at specific Position in a Singly Linked List in C++

C++ Program to Insert a node at a given position in a Singly Linked List 

Here we will learn to write a program to insert a node at a specific position in a Singly Linked List in C++. A linked list is a collection of nodes which stores data and a pointer pointing towards the next node.

insert

Steps to Insert

  • Take the user input n, for the position where the new node has to be inserted
  • Create the memory the new node and assign its data value
  • Traverse till the (n-1)th node and change its next pointer to the new Node created
  • Change the next pointer of this new node and assign it to the address of (n+1)th node.
Insertion at a Specific Position in a Linked List in C++

C++ Program to Insert a node at a given position in a Singly Linked List

Run
// Linked List Insertion at a specific position in C++
#include<iostream>
using namespace std;

class Node
{
public:
  int data;
  Node *next;
};

// Create a global variable for the size of the Linked List
int listSize = 0; // Rename the global size variable

void insert(Node **head, int data)
{
  Node *new_node = new Node();
  new_node->data = data;
  new_node->next = *head;
  *head = new_node;
  listSize++; // Update the global size variable
}

// Method to insert at a given position
void insertPosition(int pos, int data, Node **head)
{
  Node *new_node = new Node();
  new_node->data = data;
  new_node->next = nullptr;

  // Invalid positions
  if (pos < 1 || pos > listSize + 1) // Use listSize instead of size
  {
    cout << "Invalid" << endl;
    return;
  }

  // Inserting as the first node
  if (pos == 1)
  {
    new_node->next = *head;
    *head = new_node;
    listSize++; // Update the global size variable
  }
  else
  {
    Node *temp = *head;

    // Traverse to the current (pos-1)th node
    while (--pos > 1)
    {
      temp = temp->next;
    }

    new_node->next = temp->next;
    temp->next = new_node;
    listSize++; // Update the global size variable
  }
}

void display(Node *node)
{
  cout << "Linked List: ";

  while (node != nullptr)
  {
    cout << node->data << " ";
    node = node->next;
  }

  cout << endl;
}

int main()
{
  Node *head = nullptr;

  insert(&head, 140);
  insert(&head, 120);
  insert(&head, 80);
  insert(&head, 60);
  insert(&head, 20);

  display(head);

  insertPosition(2, 40, &head);

  insertPosition(5, 100, &head);

  insertPosition(8, 160, &head);

  display(head);

  return 0;
}

Output

Linked List : 20 60 80 120 140 
Linked List : 20 40 60 80 100 120 140 160

Prime Course Trailer

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

Checkout list of all the video courses in PrepInsta Prime Subscription

Singly Linked List

  • Introduction to Linked List in Data Structure
    Click Here
  • 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
  • Linked List Insertion and Deletion –
    C | C++Java
  • Reverse a linked list without changing links between nodes (Data reverse only) –
    C | C++Java
  • Reverse a linked list by changing links between nodes –
    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

Singly Linked List

  • 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